./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_6.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_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_6.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:23:22,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:23:22,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:23:22,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:23:22,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:23:22,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:23:22,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:23:22,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:23:22,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:23:22,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:23:22,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:23:22,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:23:22,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:23:22,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:23:22,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:23:22,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:23:22,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:23:22,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:23:22,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:23:22,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:23:22,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:23:22,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:23:22,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:23:22,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:23:22,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:23:22,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:23:22,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:23:22,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:23:22,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:23:22,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:23:22,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:23:22,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:23:22,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:23:22,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:23:22,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:23:22,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:23:22,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:23:22,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:23:22,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:23:22,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:23:22,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:23:22,938 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:23:22,962 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:23:22,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:23:22,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:23:22,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:23:22,974 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:23:22,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:23:22,974 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:23:22,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:23:22,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:23:22,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:23:22,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:23:22,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:23:22,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:23:22,976 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:23:22,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:23:22,976 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:23:22,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:23:22,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:23:22,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:23:22,978 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:23:22,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:23:22,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:23:22,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:23:22,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:23:22,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:23:22,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:23:22,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:23:22,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:23:22,980 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_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2019-11-19 22:23:23,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:23:23,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:23:23,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:23:23,183 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:23:23,184 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:23:23,185 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_6.c [2019-11-19 22:23:23,254 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/data/1c33a7a24/92ef55967ebe4d358e0088a33a6e1e3c/FLAGb69d73e89 [2019-11-19 22:23:23,596 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:23:23,597 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/sv-benchmarks/c/locks/test_locks_6.c [2019-11-19 22:23:23,605 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/data/1c33a7a24/92ef55967ebe4d358e0088a33a6e1e3c/FLAGb69d73e89 [2019-11-19 22:23:23,964 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/data/1c33a7a24/92ef55967ebe4d358e0088a33a6e1e3c [2019-11-19 22:23:23,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:23:23,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:23:23,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:23:23,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:23:23,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:23:23,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:23:23" (1/1) ... [2019-11-19 22:23:23,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5195dffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:23, skipping insertion in model container [2019-11-19 22:23:23,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:23:23" (1/1) ... [2019-11-19 22:23:23,990 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:23:24,011 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:23:24,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:23:24,172 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:23:24,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:23:24,280 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:23:24,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24 WrapperNode [2019-11-19 22:23:24,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:23:24,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:23:24,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:23:24,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:23:24,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (1/1) ... [2019-11-19 22:23:24,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (1/1) ... [2019-11-19 22:23:24,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:23:24,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:23:24,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:23:24,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:23:24,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (1/1) ... [2019-11-19 22:23:24,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (1/1) ... [2019-11-19 22:23:24,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (1/1) ... [2019-11-19 22:23:24,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (1/1) ... [2019-11-19 22:23:24,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (1/1) ... [2019-11-19 22:23:24,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (1/1) ... [2019-11-19 22:23:24,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (1/1) ... [2019-11-19 22:23:24,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:23:24,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:23:24,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:23:24,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:23:24,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/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-19 22:23:24,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:23:24,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:23:24,718 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:23:24,719 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 22:23:24,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:23:24 BoogieIcfgContainer [2019-11-19 22:23:24,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:23:24,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:23:24,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:23:24,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:23:24,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:23:23" (1/3) ... [2019-11-19 22:23:24,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16849a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:23:24, skipping insertion in model container [2019-11-19 22:23:24,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:23:24" (2/3) ... [2019-11-19 22:23:24,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16849a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:23:24, skipping insertion in model container [2019-11-19 22:23:24,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:23:24" (3/3) ... [2019-11-19 22:23:24,746 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-11-19 22:23:24,755 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:23:24,773 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:23:24,801 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:23:24,837 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:23:24,837 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:23:24,838 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:23:24,838 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:23:24,838 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:23:24,838 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:23:24,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:23:24,841 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:23:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-19 22:23:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 22:23:24,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:24,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:24,869 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:24,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:24,875 INFO L82 PathProgramCache]: Analyzing trace with hash 502900931, now seen corresponding path program 1 times [2019-11-19 22:23:24,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:24,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794687403] [2019-11-19 22:23:24,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794687403] [2019-11-19 22:23:25,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142019707] [2019-11-19 22:23:25,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,122 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-11-19 22:23:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,170 INFO L93 Difference]: Finished difference Result 58 states and 96 transitions. [2019-11-19 22:23:25,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-19 22:23:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,183 INFO L225 Difference]: With dead ends: 58 [2019-11-19 22:23:25,183 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 22:23:25,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 22:23:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2019-11-19 22:23:25,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-19 22:23:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2019-11-19 22:23:25,223 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 12 [2019-11-19 22:23:25,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,223 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2019-11-19 22:23:25,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2019-11-19 22:23:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 22:23:25,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,225 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1182959301, now seen corresponding path program 1 times [2019-11-19 22:23:25,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681216853] [2019-11-19 22:23:25,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681216853] [2019-11-19 22:23:25,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114890954] [2019-11-19 22:23:25,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,267 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand 3 states. [2019-11-19 22:23:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,290 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2019-11-19 22:23:25,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-19 22:23:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,293 INFO L225 Difference]: With dead ends: 73 [2019-11-19 22:23:25,293 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 22:23:25,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 22:23:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-19 22:23:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-19 22:23:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-11-19 22:23:25,300 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 12 [2019-11-19 22:23:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,301 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-11-19 22:23:25,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-11-19 22:23:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:23:25,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,302 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1589725680, now seen corresponding path program 1 times [2019-11-19 22:23:25,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265914932] [2019-11-19 22:23:25,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265914932] [2019-11-19 22:23:25,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338973860] [2019-11-19 22:23:25,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,334 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-11-19 22:23:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,365 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2019-11-19 22:23:25,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 22:23:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,367 INFO L225 Difference]: With dead ends: 68 [2019-11-19 22:23:25,367 INFO L226 Difference]: Without dead ends: 47 [2019-11-19 22:23:25,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-19 22:23:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-19 22:23:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-19 22:23:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2019-11-19 22:23:25,375 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 13 [2019-11-19 22:23:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,375 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2019-11-19 22:23:25,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2019-11-19 22:23:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:23:25,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,377 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1982752690, now seen corresponding path program 1 times [2019-11-19 22:23:25,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859549026] [2019-11-19 22:23:25,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859549026] [2019-11-19 22:23:25,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557173079] [2019-11-19 22:23:25,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,431 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. [2019-11-19 22:23:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,454 INFO L93 Difference]: Finished difference Result 84 states and 140 transitions. [2019-11-19 22:23:25,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 22:23:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,456 INFO L225 Difference]: With dead ends: 84 [2019-11-19 22:23:25,456 INFO L226 Difference]: Without dead ends: 82 [2019-11-19 22:23:25,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-19 22:23:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-19 22:23:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-19 22:23:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 100 transitions. [2019-11-19 22:23:25,465 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 100 transitions. Word has length 13 [2019-11-19 22:23:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,465 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 100 transitions. [2019-11-19 22:23:25,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 100 transitions. [2019-11-19 22:23:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:23:25,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,466 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,466 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1302694320, now seen corresponding path program 1 times [2019-11-19 22:23:25,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744084340] [2019-11-19 22:23:25,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744084340] [2019-11-19 22:23:25,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007477689] [2019-11-19 22:23:25,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,496 INFO L87 Difference]: Start difference. First operand 60 states and 100 transitions. Second operand 3 states. [2019-11-19 22:23:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,513 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2019-11-19 22:23:25,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 22:23:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,515 INFO L225 Difference]: With dead ends: 140 [2019-11-19 22:23:25,515 INFO L226 Difference]: Without dead ends: 84 [2019-11-19 22:23:25,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-19 22:23:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-11-19 22:23:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-19 22:23:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2019-11-19 22:23:25,525 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 13 [2019-11-19 22:23:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,525 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2019-11-19 22:23:25,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2019-11-19 22:23:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 22:23:25,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,527 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1335576262, now seen corresponding path program 1 times [2019-11-19 22:23:25,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390718328] [2019-11-19 22:23:25,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390718328] [2019-11-19 22:23:25,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665257489] [2019-11-19 22:23:25,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,555 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand 3 states. [2019-11-19 22:23:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,575 INFO L93 Difference]: Finished difference Result 125 states and 201 transitions. [2019-11-19 22:23:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-19 22:23:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,577 INFO L225 Difference]: With dead ends: 125 [2019-11-19 22:23:25,577 INFO L226 Difference]: Without dead ends: 86 [2019-11-19 22:23:25,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-19 22:23:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-11-19 22:23:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-19 22:23:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2019-11-19 22:23:25,589 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 14 [2019-11-19 22:23:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,589 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2019-11-19 22:23:25,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2019-11-19 22:23:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 22:23:25,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,591 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1728603272, now seen corresponding path program 1 times [2019-11-19 22:23:25,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412161068] [2019-11-19 22:23:25,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412161068] [2019-11-19 22:23:25,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216945906] [2019-11-19 22:23:25,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,617 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand 3 states. [2019-11-19 22:23:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,645 INFO L93 Difference]: Finished difference Result 236 states and 376 transitions. [2019-11-19 22:23:25,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-19 22:23:25,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,647 INFO L225 Difference]: With dead ends: 236 [2019-11-19 22:23:25,647 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 22:23:25,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 22:23:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-11-19 22:23:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-19 22:23:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2019-11-19 22:23:25,672 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 14 [2019-11-19 22:23:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,673 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2019-11-19 22:23:25,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2019-11-19 22:23:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 22:23:25,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,677 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1886305654, now seen corresponding path program 1 times [2019-11-19 22:23:25,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353520978] [2019-11-19 22:23:25,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353520978] [2019-11-19 22:23:25,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896138910] [2019-11-19 22:23:25,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,707 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand 3 states. [2019-11-19 22:23:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,722 INFO L93 Difference]: Finished difference Result 192 states and 300 transitions. [2019-11-19 22:23:25,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-19 22:23:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,724 INFO L225 Difference]: With dead ends: 192 [2019-11-19 22:23:25,724 INFO L226 Difference]: Without dead ends: 190 [2019-11-19 22:23:25,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-19 22:23:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2019-11-19 22:23:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-19 22:23:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2019-11-19 22:23:25,736 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 14 [2019-11-19 22:23:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,737 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2019-11-19 22:23:25,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2019-11-19 22:23:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:23:25,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,739 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2046878555, now seen corresponding path program 1 times [2019-11-19 22:23:25,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492569872] [2019-11-19 22:23:25,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492569872] [2019-11-19 22:23:25,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167136182] [2019-11-19 22:23:25,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,776 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 3 states. [2019-11-19 22:23:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,801 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2019-11-19 22:23:25,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-19 22:23:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,803 INFO L225 Difference]: With dead ends: 276 [2019-11-19 22:23:25,803 INFO L226 Difference]: Without dead ends: 274 [2019-11-19 22:23:25,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-19 22:23:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2019-11-19 22:23:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-19 22:23:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 334 transitions. [2019-11-19 22:23:25,816 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 334 transitions. Word has length 15 [2019-11-19 22:23:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,817 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 334 transitions. [2019-11-19 22:23:25,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 334 transitions. [2019-11-19 22:23:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:23:25,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,819 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,819 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1366820185, now seen corresponding path program 1 times [2019-11-19 22:23:25,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982330296] [2019-11-19 22:23:25,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982330296] [2019-11-19 22:23:25,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895885098] [2019-11-19 22:23:25,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,852 INFO L87 Difference]: Start difference. First operand 224 states and 334 transitions. Second operand 3 states. [2019-11-19 22:23:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,888 INFO L93 Difference]: Finished difference Result 516 states and 768 transitions. [2019-11-19 22:23:25,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-19 22:23:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,896 INFO L225 Difference]: With dead ends: 516 [2019-11-19 22:23:25,896 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 22:23:25,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 22:23:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-11-19 22:23:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-19 22:23:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 426 transitions. [2019-11-19 22:23:25,918 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 426 transitions. Word has length 15 [2019-11-19 22:23:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,918 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 426 transitions. [2019-11-19 22:23:25,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2019-11-19 22:23:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:23:25,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,920 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,921 INFO L82 PathProgramCache]: Analyzing trace with hash 971489901, now seen corresponding path program 1 times [2019-11-19 22:23:25,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719367871] [2019-11-19 22:23:25,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:25,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719367871] [2019-11-19 22:23:25,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:25,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:25,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017048860] [2019-11-19 22:23:25,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:25,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:25,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,948 INFO L87 Difference]: Start difference. First operand 296 states and 426 transitions. Second operand 3 states. [2019-11-19 22:23:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:25,970 INFO L93 Difference]: Finished difference Result 452 states and 648 transitions. [2019-11-19 22:23:25,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:25,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-19 22:23:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:25,972 INFO L225 Difference]: With dead ends: 452 [2019-11-19 22:23:25,973 INFO L226 Difference]: Without dead ends: 310 [2019-11-19 22:23:25,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-19 22:23:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-11-19 22:23:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-19 22:23:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 434 transitions. [2019-11-19 22:23:25,989 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 434 transitions. Word has length 16 [2019-11-19 22:23:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:25,990 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 434 transitions. [2019-11-19 22:23:25,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2019-11-19 22:23:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:23:25,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:25,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:25,995 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:25,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:25,998 INFO L82 PathProgramCache]: Analyzing trace with hash 578462891, now seen corresponding path program 1 times [2019-11-19 22:23:25,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:25,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802635574] [2019-11-19 22:23:25,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:26,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802635574] [2019-11-19 22:23:26,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:26,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:26,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866774343] [2019-11-19 22:23:26,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:26,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:26,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:26,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:26,019 INFO L87 Difference]: Start difference. First operand 308 states and 434 transitions. Second operand 3 states. [2019-11-19 22:23:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:26,050 INFO L93 Difference]: Finished difference Result 520 states and 732 transitions. [2019-11-19 22:23:26,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:26,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-19 22:23:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:26,056 INFO L225 Difference]: With dead ends: 520 [2019-11-19 22:23:26,056 INFO L226 Difference]: Without dead ends: 518 [2019-11-19 22:23:26,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-11-19 22:23:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 452. [2019-11-19 22:23:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-19 22:23:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 618 transitions. [2019-11-19 22:23:26,076 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 618 transitions. Word has length 16 [2019-11-19 22:23:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:26,077 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 618 transitions. [2019-11-19 22:23:26,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 618 transitions. [2019-11-19 22:23:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:23:26,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:26,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:26,079 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1258521261, now seen corresponding path program 1 times [2019-11-19 22:23:26,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:26,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717395426] [2019-11-19 22:23:26,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:26,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717395426] [2019-11-19 22:23:26,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:26,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:26,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70876928] [2019-11-19 22:23:26,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:26,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:26,123 INFO L87 Difference]: Start difference. First operand 452 states and 618 transitions. Second operand 3 states. [2019-11-19 22:23:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:26,159 INFO L93 Difference]: Finished difference Result 1016 states and 1372 transitions. [2019-11-19 22:23:26,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:26,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-19 22:23:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:26,163 INFO L225 Difference]: With dead ends: 1016 [2019-11-19 22:23:26,163 INFO L226 Difference]: Without dead ends: 582 [2019-11-19 22:23:26,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-11-19 22:23:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2019-11-19 22:23:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-19 22:23:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 754 transitions. [2019-11-19 22:23:26,186 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 754 transitions. Word has length 16 [2019-11-19 22:23:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:26,187 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 754 transitions. [2019-11-19 22:23:26,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 754 transitions. [2019-11-19 22:23:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:23:26,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:26,189 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:26,189 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:26,189 INFO L82 PathProgramCache]: Analyzing trace with hash 752696444, now seen corresponding path program 1 times [2019-11-19 22:23:26,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:26,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306889812] [2019-11-19 22:23:26,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:26,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306889812] [2019-11-19 22:23:26,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:26,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:26,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515794068] [2019-11-19 22:23:26,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:26,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:26,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:26,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:26,207 INFO L87 Difference]: Start difference. First operand 580 states and 754 transitions. Second operand 3 states. [2019-11-19 22:23:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:26,230 INFO L93 Difference]: Finished difference Result 872 states and 1124 transitions. [2019-11-19 22:23:26,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:26,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 22:23:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:26,234 INFO L225 Difference]: With dead ends: 872 [2019-11-19 22:23:26,234 INFO L226 Difference]: Without dead ends: 598 [2019-11-19 22:23:26,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-19 22:23:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-11-19 22:23:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-19 22:23:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 754 transitions. [2019-11-19 22:23:26,255 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 754 transitions. Word has length 17 [2019-11-19 22:23:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:26,255 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 754 transitions. [2019-11-19 22:23:26,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 754 transitions. [2019-11-19 22:23:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:23:26,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:26,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:26,257 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash 359669434, now seen corresponding path program 1 times [2019-11-19 22:23:26,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:26,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653252808] [2019-11-19 22:23:26,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:26,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653252808] [2019-11-19 22:23:26,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:26,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:26,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103197213] [2019-11-19 22:23:26,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:26,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:26,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:26,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:26,276 INFO L87 Difference]: Start difference. First operand 596 states and 754 transitions. Second operand 3 states. [2019-11-19 22:23:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:26,302 INFO L93 Difference]: Finished difference Result 966 states and 1203 transitions. [2019-11-19 22:23:26,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:26,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 22:23:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:26,308 INFO L225 Difference]: With dead ends: 966 [2019-11-19 22:23:26,308 INFO L226 Difference]: Without dead ends: 964 [2019-11-19 22:23:26,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-11-19 22:23:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 900. [2019-11-19 22:23:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-11-19 22:23:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1106 transitions. [2019-11-19 22:23:26,340 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1106 transitions. Word has length 17 [2019-11-19 22:23:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:26,340 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1106 transitions. [2019-11-19 22:23:26,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1106 transitions. [2019-11-19 22:23:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:23:26,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:26,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:26,343 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1039727804, now seen corresponding path program 1 times [2019-11-19 22:23:26,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:23:26,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805929052] [2019-11-19 22:23:26,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:23:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:23:26,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805929052] [2019-11-19 22:23:26,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:23:26,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:23:26,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047149382] [2019-11-19 22:23:26,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:23:26,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:23:26,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:23:26,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:26,364 INFO L87 Difference]: Start difference. First operand 900 states and 1106 transitions. Second operand 3 states. [2019-11-19 22:23:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:26,401 INFO L93 Difference]: Finished difference Result 1988 states and 2386 transitions. [2019-11-19 22:23:26,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:23:26,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 22:23:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:26,402 INFO L225 Difference]: With dead ends: 1988 [2019-11-19 22:23:26,402 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:23:26,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:23:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:23:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:23:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:23:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:23:26,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-19 22:23:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:26,405 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:23:26,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:23:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:23:26,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:23:26,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:23:26,434 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-19 22:23:26,434 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,434 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:23:26,434 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:23:26,434 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-19 22:23:26,435 INFO L447 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-11-19 22:23:26,435 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-11-19 22:23:26,435 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,435 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,435 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,435 INFO L444 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-19 22:23:26,435 INFO L444 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,435 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-19 22:23:26,435 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,436 INFO L447 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-11-19 22:23:26,436 INFO L447 ceAbstractionStarter]: At program point L106(lines 4 107) the Hoare annotation is: true [2019-11-19 22:23:26,436 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-19 22:23:26,436 INFO L444 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-11-19 22:23:26,436 INFO L440 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-11-19 22:23:26,436 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-11-19 22:23:26,436 INFO L444 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,436 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,437 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:23:26,437 INFO L444 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,437 INFO L444 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-19 22:23:26,437 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,437 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-11-19 22:23:26,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:23:26 BoogieIcfgContainer [2019-11-19 22:23:26,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:23:26,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:23:26,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:23:26,454 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:23:26,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:23:24" (3/4) ... [2019-11-19 22:23:26,458 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:23:26,471 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 22:23:26,471 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:23:26,544 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3a0765dc-ac8c-42f5-b2ac-c4e8a597e0f2/bin/uautomizer/witness.graphml [2019-11-19 22:23:26,544 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:23:26,547 INFO L168 Benchmark]: Toolchain (without parser) took 2576.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.8 MB in the beginning and 936.2 MB in the end (delta: 8.6 MB). Peak memory consumption was 152.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:23:26,547 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:23:26,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:23:26,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:23:26,548 INFO L168 Benchmark]: Boogie Preprocessor took 49.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:23:26,549 INFO L168 Benchmark]: RCFGBuilder took 344.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:23:26,549 INFO L168 Benchmark]: TraceAbstraction took 1732.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.6 MB in the end (delta: 171.9 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:23:26,549 INFO L168 Benchmark]: Witness Printer took 91.37 ms. Allocated memory is still 1.2 GB. Free memory was 941.6 MB in the beginning and 936.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:23:26,552 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 344.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1732.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.6 MB in the end (delta: 171.9 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. * Witness Printer took 91.37 ms. Allocated memory is still 1.2 GB. Free memory was 941.6 MB in the beginning and 936.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 812 SDtfs, 391 SDslu, 511 SDs, 0 SdLazy, 85 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 73 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 6130 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...