./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe019_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/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 25398bc4afbcfbc19351e40c90cea357d107f73e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:35:10,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:35:10,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:35:10,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:35:10,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:35:10,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:35:10,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:35:10,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:35:10,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:35:10,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:35:10,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:35:10,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:35:10,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:35:10,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:35:10,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:35:10,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:35:10,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:35:10,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:35:10,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:35:10,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:35:10,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:35:10,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:35:10,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:35:10,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:35:11,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:35:11,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:35:11,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:35:11,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:35:11,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:35:11,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:35:11,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:35:11,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:35:11,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:35:11,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:35:11,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:35:11,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:35:11,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:35:11,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:35:11,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:35:11,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:35:11,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:35:11,006 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:35:11,015 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:35:11,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:35:11,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:35:11,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:35:11,017 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:35:11,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:35:11,017 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:35:11,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:35:11,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:35:11,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:35:11,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:35:11,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:35:11,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:35:11,018 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:35:11,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:35:11,018 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:35:11,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:35:11,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:35:11,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:35:11,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:35:11,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:35:11,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:35:11,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:35:11,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:35:11,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:35:11,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:35:11,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:35:11,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:35:11,019 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:35:11,020 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_f2add1d9-23d1-4d1e-a06d-526064e2764e/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 -> 25398bc4afbcfbc19351e40c90cea357d107f73e [2019-12-07 17:35:11,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:35:11,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:35:11,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:35:11,136 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:35:11,137 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:35:11,137 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe019_tso.opt.i [2019-12-07 17:35:11,183 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/data/61660568d/9d14813b1b074faa8ed863e07ea8f551/FLAG99de692c2 [2019-12-07 17:35:11,542 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:35:11,543 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/sv-benchmarks/c/pthread-wmm/safe019_tso.opt.i [2019-12-07 17:35:11,553 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/data/61660568d/9d14813b1b074faa8ed863e07ea8f551/FLAG99de692c2 [2019-12-07 17:35:11,562 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/data/61660568d/9d14813b1b074faa8ed863e07ea8f551 [2019-12-07 17:35:11,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:35:11,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:35:11,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:35:11,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:35:11,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:35:11,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f04252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11, skipping insertion in model container [2019-12-07 17:35:11,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:35:11,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:35:11,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:35:11,842 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:35:11,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:35:11,920 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:35:11,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11 WrapperNode [2019-12-07 17:35:11,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:35:11,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:35:11,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:35:11,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:35:11,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:35:11,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:35:11,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:35:11,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:35:11,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (1/1) ... [2019-12-07 17:35:11,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:35:11,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:35:11,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:35:11,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:35:11,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:35:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:35:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:35:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:35:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:35:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:35:12,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:35:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:35:12,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:35:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:35:12,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:35:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 17:35:12,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 17:35:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:35:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:35:12,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:35:12,020 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:35:12,210 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:35:12,210 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 17:35:12,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:35:12 BoogieIcfgContainer [2019-12-07 17:35:12,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:35:12,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:35:12,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:35:12,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:35:12,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:35:11" (1/3) ... [2019-12-07 17:35:12,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0bf645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:35:12, skipping insertion in model container [2019-12-07 17:35:12,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:11" (2/3) ... [2019-12-07 17:35:12,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0bf645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:35:12, skipping insertion in model container [2019-12-07 17:35:12,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:35:12" (3/3) ... [2019-12-07 17:35:12,215 INFO L109 eAbstractionObserver]: Analyzing ICFG safe019_tso.opt.i [2019-12-07 17:35:12,221 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:35:12,221 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:35:12,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:35:12,226 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:35:12,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,245 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,245 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,247 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,247 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,247 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,247 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:12,262 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:35:12,274 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:35:12,274 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:35:12,274 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:35:12,274 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:35:12,274 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:35:12,274 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:35:12,274 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:35:12,275 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:35:12,283 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 64 transitions [2019-12-07 17:35:12,284 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 64 transitions [2019-12-07 17:35:12,312 INFO L134 PetriNetUnfolder]: 1/60 cut-off events. [2019-12-07 17:35:12,313 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:35:12,317 INFO L76 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 60 events. 1/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs. 12/70 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2019-12-07 17:35:12,319 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 64 transitions [2019-12-07 17:35:12,331 INFO L134 PetriNetUnfolder]: 1/60 cut-off events. [2019-12-07 17:35:12,331 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:35:12,332 INFO L76 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 60 events. 1/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs. 12/70 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2019-12-07 17:35:12,334 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 732 [2019-12-07 17:35:12,334 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:35:13,176 INFO L206 etLargeBlockEncoding]: Checked pairs total: 721 [2019-12-07 17:35:13,176 INFO L214 etLargeBlockEncoding]: Total number of compositions: 48 [2019-12-07 17:35:13,178 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 19 transitions [2019-12-07 17:35:13,189 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 94 states. [2019-12-07 17:35:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2019-12-07 17:35:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 17:35:13,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:13,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:13,196 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:13,200 INFO L82 PathProgramCache]: Analyzing trace with hash -989464989, now seen corresponding path program 1 times [2019-12-07 17:35:13,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:13,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242842086] [2019-12-07 17:35:13,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:13,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242842086] [2019-12-07 17:35:13,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:13,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:35:13,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718106630] [2019-12-07 17:35:13,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:35:13,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:13,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:35:13,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:13,406 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 3 states. [2019-12-07 17:35:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:13,434 INFO L93 Difference]: Finished difference Result 124 states and 283 transitions. [2019-12-07 17:35:13,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:35:13,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 17:35:13,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:13,444 INFO L225 Difference]: With dead ends: 124 [2019-12-07 17:35:13,444 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 17:35:13,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 17:35:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 17:35:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2019-12-07 17:35:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 17:35:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 194 transitions. [2019-12-07 17:35:13,475 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 194 transitions. Word has length 10 [2019-12-07 17:35:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:13,476 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 194 transitions. [2019-12-07 17:35:13,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:35:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 194 transitions. [2019-12-07 17:35:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:35:13,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:13,477 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:13,477 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:13,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1170715911, now seen corresponding path program 1 times [2019-12-07 17:35:13,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:13,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670673739] [2019-12-07 17:35:13,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:13,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670673739] [2019-12-07 17:35:13,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:13,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:35:13,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386171361] [2019-12-07 17:35:13,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:35:13,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:13,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:35:13,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:13,542 INFO L87 Difference]: Start difference. First operand 86 states and 194 transitions. Second operand 4 states. [2019-12-07 17:35:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:13,556 INFO L93 Difference]: Finished difference Result 80 states and 175 transitions. [2019-12-07 17:35:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:35:13,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:35:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:13,557 INFO L225 Difference]: With dead ends: 80 [2019-12-07 17:35:13,557 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 17:35:13,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 17:35:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-12-07 17:35:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 17:35:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 163 transitions. [2019-12-07 17:35:13,564 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 163 transitions. Word has length 11 [2019-12-07 17:35:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:13,564 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 163 transitions. [2019-12-07 17:35:13,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:35:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 163 transitions. [2019-12-07 17:35:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:35:13,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:13,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:13,565 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:13,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1709122238, now seen corresponding path program 1 times [2019-12-07 17:35:13,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:13,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025692473] [2019-12-07 17:35:13,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:13,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025692473] [2019-12-07 17:35:13,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:13,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:35:13,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350212342] [2019-12-07 17:35:13,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:35:13,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:35:13,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:13,613 INFO L87 Difference]: Start difference. First operand 76 states and 163 transitions. Second operand 4 states. [2019-12-07 17:35:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:13,629 INFO L93 Difference]: Finished difference Result 78 states and 162 transitions. [2019-12-07 17:35:13,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:35:13,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 17:35:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:13,630 INFO L225 Difference]: With dead ends: 78 [2019-12-07 17:35:13,630 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 17:35:13,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 17:35:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2019-12-07 17:35:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 17:35:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 124 transitions. [2019-12-07 17:35:13,634 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 124 transitions. Word has length 12 [2019-12-07 17:35:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:13,634 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 124 transitions. [2019-12-07 17:35:13,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:35:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 124 transitions. [2019-12-07 17:35:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:35:13,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:13,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:13,635 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:13,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:13,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1707570409, now seen corresponding path program 1 times [2019-12-07 17:35:13,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:13,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039739623] [2019-12-07 17:35:13,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:13,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039739623] [2019-12-07 17:35:13,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:13,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:35:13,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376794745] [2019-12-07 17:35:13,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:35:13,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:13,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:35:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:13,677 INFO L87 Difference]: Start difference. First operand 58 states and 124 transitions. Second operand 4 states. [2019-12-07 17:35:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:13,689 INFO L93 Difference]: Finished difference Result 64 states and 133 transitions. [2019-12-07 17:35:13,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:35:13,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 17:35:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:13,690 INFO L225 Difference]: With dead ends: 64 [2019-12-07 17:35:13,690 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 17:35:13,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:13,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 17:35:13,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2019-12-07 17:35:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 17:35:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 119 transitions. [2019-12-07 17:35:13,695 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 119 transitions. Word has length 12 [2019-12-07 17:35:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:13,696 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 119 transitions. [2019-12-07 17:35:13,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:35:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 119 transitions. [2019-12-07 17:35:13,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:35:13,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:13,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:13,697 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:13,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:13,697 INFO L82 PathProgramCache]: Analyzing trace with hash 203952685, now seen corresponding path program 1 times [2019-12-07 17:35:13,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:13,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372362090] [2019-12-07 17:35:13,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:13,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372362090] [2019-12-07 17:35:13,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:13,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:35:13,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951481798] [2019-12-07 17:35:13,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:35:13,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:35:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:35:13,749 INFO L87 Difference]: Start difference. First operand 56 states and 119 transitions. Second operand 5 states. [2019-12-07 17:35:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:13,767 INFO L93 Difference]: Finished difference Result 68 states and 137 transitions. [2019-12-07 17:35:13,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:35:13,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 17:35:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:13,768 INFO L225 Difference]: With dead ends: 68 [2019-12-07 17:35:13,768 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 17:35:13,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:35:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 17:35:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 17:35:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 17:35:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 79 transitions. [2019-12-07 17:35:13,772 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 79 transitions. Word has length 13 [2019-12-07 17:35:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:13,773 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 79 transitions. [2019-12-07 17:35:13,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:35:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 79 transitions. [2019-12-07 17:35:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:35:13,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:13,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:13,774 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:13,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1443182165, now seen corresponding path program 2 times [2019-12-07 17:35:13,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:13,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254102600] [2019-12-07 17:35:13,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:13,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254102600] [2019-12-07 17:35:13,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:13,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:35:13,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761730544] [2019-12-07 17:35:13,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:35:13,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:13,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:35:13,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:35:13,825 INFO L87 Difference]: Start difference. First operand 42 states and 79 transitions. Second operand 5 states. [2019-12-07 17:35:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:13,844 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2019-12-07 17:35:13,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:35:13,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 17:35:13,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:13,845 INFO L225 Difference]: With dead ends: 46 [2019-12-07 17:35:13,845 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 17:35:13,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:35:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 17:35:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 17:35:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 17:35:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-12-07 17:35:13,848 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 13 [2019-12-07 17:35:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:13,848 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-12-07 17:35:13,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:35:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-12-07 17:35:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:35:13,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:13,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:13,849 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1395075125, now seen corresponding path program 3 times [2019-12-07 17:35:13,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:13,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630862975] [2019-12-07 17:35:13,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:13,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630862975] [2019-12-07 17:35:13,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:13,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:35:13,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292927609] [2019-12-07 17:35:13,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:35:13,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:13,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:35:13,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:35:13,913 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 6 states. [2019-12-07 17:35:13,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:13,953 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2019-12-07 17:35:13,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:35:13,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 17:35:13,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:13,954 INFO L225 Difference]: With dead ends: 37 [2019-12-07 17:35:13,954 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 17:35:13,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:35:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 17:35:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 17:35:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 17:35:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2019-12-07 17:35:13,956 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 44 transitions. Word has length 13 [2019-12-07 17:35:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:13,956 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 44 transitions. [2019-12-07 17:35:13,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:35:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2019-12-07 17:35:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:35:13,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:13,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:13,957 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1393398335, now seen corresponding path program 4 times [2019-12-07 17:35:13,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:13,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669378261] [2019-12-07 17:35:13,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:14,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669378261] [2019-12-07 17:35:14,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:14,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:35:14,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995015818] [2019-12-07 17:35:14,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:35:14,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:35:14,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:35:14,006 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. Second operand 7 states. [2019-12-07 17:35:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:14,064 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2019-12-07 17:35:14,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:35:14,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-12-07 17:35:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:14,065 INFO L225 Difference]: With dead ends: 29 [2019-12-07 17:35:14,065 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 17:35:14,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:35:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 17:35:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 17:35:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 17:35:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-12-07 17:35:14,067 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 13 [2019-12-07 17:35:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:14,067 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-12-07 17:35:14,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:35:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-12-07 17:35:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:35:14,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:14,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:14,068 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash -532613606, now seen corresponding path program 1 times [2019-12-07 17:35:14,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:14,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323805606] [2019-12-07 17:35:14,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:14,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323805606] [2019-12-07 17:35:14,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:14,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:35:14,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690371304] [2019-12-07 17:35:14,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:35:14,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:35:14,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:14,104 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 4 states. [2019-12-07 17:35:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:14,123 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2019-12-07 17:35:14,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:35:14,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:35:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:14,124 INFO L225 Difference]: With dead ends: 28 [2019-12-07 17:35:14,124 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 17:35:14,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:35:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 17:35:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 17:35:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 17:35:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 17:35:14,126 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-12-07 17:35:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:14,127 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 17:35:14,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:35:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 17:35:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:35:14,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:14,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:14,127 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:14,128 INFO L82 PathProgramCache]: Analyzing trace with hash -245617918, now seen corresponding path program 2 times [2019-12-07 17:35:14,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:14,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688083237] [2019-12-07 17:35:14,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:14,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688083237] [2019-12-07 17:35:14,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:14,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:35:14,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050483468] [2019-12-07 17:35:14,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:35:14,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:14,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:35:14,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:14,158 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 4 states. [2019-12-07 17:35:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:14,167 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-12-07 17:35:14,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:35:14,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:35:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:14,167 INFO L225 Difference]: With dead ends: 16 [2019-12-07 17:35:14,167 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:35:14,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:35:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:35:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:35:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:35:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:35:14,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-12-07 17:35:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:14,168 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:35:14,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:35:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:35:14,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:35:14,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:35:14 BasicIcfg [2019-12-07 17:35:14,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:35:14,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:35:14,171 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:35:14,172 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:35:14,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:35:12" (3/4) ... [2019-12-07 17:35:14,174 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:35:14,179 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-12-07 17:35:14,179 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-12-07 17:35:14,179 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-12-07 17:35:14,179 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-12-07 17:35:14,182 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-12-07 17:35:14,183 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 17:35:14,183 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 17:35:14,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f2add1d9-23d1-4d1e-a06d-526064e2764e/bin/uautomizer/witness.graphml [2019-12-07 17:35:14,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:35:14,219 INFO L168 Benchmark]: Toolchain (without parser) took 2653.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 939.9 MB in the beginning and 941.1 MB in the end (delta: -1.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:14,220 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:35:14,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:14,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.63 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:35:14,221 INFO L168 Benchmark]: Boogie Preprocessor took 18.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:14,221 INFO L168 Benchmark]: RCFGBuilder took 239.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:14,222 INFO L168 Benchmark]: TraceAbstraction took 1959.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 948.0 MB in the end (delta: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:14,222 INFO L168 Benchmark]: Witness Printer took 46.08 ms. Allocated memory is still 1.1 GB. Free memory was 948.0 MB in the beginning and 941.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:14,224 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.63 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 239.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1959.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 948.0 MB in the end (delta: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. * Witness Printer took 46.08 ms. Allocated memory is still 1.1 GB. Free memory was 948.0 MB in the beginning and 941.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 76 ProgramPointsBefore, 27 ProgramPointsAfterwards, 64 TransitionsBefore, 19 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 6 FixpointIterations, 14 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 354 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 1 SemBasedMoverChecksPositive, 16 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 721 CheckedPairsTotal, 48 TotalNumberOfCompositions - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 64 locations, 1 error locations. Result: SAFE, OverallTime: 1.8s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 142 SDtfs, 154 SDslu, 122 SDs, 0 SdLazy, 100 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 7703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...