./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/16_peterson.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/16_peterson.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe2a87bf03514f77a2923708fa633129c30ac7f0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 20:20:12,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 20:20:13,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 20:20:13,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 20:20:13,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 20:20:13,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 20:20:13,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 20:20:13,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 20:20:13,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 20:20:13,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 20:20:13,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 20:20:13,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 20:20:13,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 20:20:13,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 20:20:13,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 20:20:13,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 20:20:13,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 20:20:13,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 20:20:13,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 20:20:13,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 20:20:13,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 20:20:13,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 20:20:13,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 20:20:13,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 20:20:13,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 20:20:13,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 20:20:13,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 20:20:13,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 20:20:13,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 20:20:13,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 20:20:13,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 20:20:13,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 20:20:13,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 20:20:13,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 20:20:13,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 20:20:13,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 20:20:13,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 20:20:13,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 20:20:13,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 20:20:13,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 20:20:13,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 20:20:13,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 20:20:13,067 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 20:20:13,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 20:20:13,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 20:20:13,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 20:20:13,069 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 20:20:13,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 20:20:13,070 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 20:20:13,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 20:20:13,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 20:20:13,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 20:20:13,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 20:20:13,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 20:20:13,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 20:20:13,072 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 20:20:13,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 20:20:13,073 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 20:20:13,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 20:20:13,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 20:20:13,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 20:20:13,074 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 20:20:13,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 20:20:13,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 20:20:13,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 20:20:13,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 20:20:13,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 20:20:13,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 20:20:13,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 20:20:13,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 20:20:13,076 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 20:20:13,077 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 -> fe2a87bf03514f77a2923708fa633129c30ac7f0 [2020-07-28 20:20:13,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 20:20:13,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 20:20:13,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 20:20:13,392 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 20:20:13,393 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 20:20:13,393 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/16_peterson.i [2020-07-28 20:20:13,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7660e89/00c1bd8c13c44edb80b71b6a1f0df73f/FLAGf925e4d2b [2020-07-28 20:20:13,896 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 20:20:13,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/16_peterson.i [2020-07-28 20:20:13,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7660e89/00c1bd8c13c44edb80b71b6a1f0df73f/FLAGf925e4d2b [2020-07-28 20:20:14,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7660e89/00c1bd8c13c44edb80b71b6a1f0df73f [2020-07-28 20:20:14,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 20:20:14,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 20:20:14,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 20:20:14,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 20:20:14,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 20:20:14,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd89e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14, skipping insertion in model container [2020-07-28 20:20:14,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 20:20:14,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 20:20:14,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 20:20:14,726 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 20:20:14,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 20:20:14,842 INFO L208 MainTranslator]: Completed translation [2020-07-28 20:20:14,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14 WrapperNode [2020-07-28 20:20:14,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 20:20:14,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 20:20:14,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 20:20:14,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 20:20:14,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 20:20:14,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 20:20:14,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 20:20:14,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 20:20:14,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (1/1) ... [2020-07-28 20:20:14,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 20:20:14,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 20:20:14,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 20:20:14,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 20:20:14,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 20:20:15,002 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-07-28 20:20:15,002 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-07-28 20:20:15,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 20:20:15,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 20:20:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 20:20:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 20:20:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 20:20:15,006 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-07-28 20:20:15,435 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 20:20:15,436 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-28 20:20:15,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 08:20:15 BoogieIcfgContainer [2020-07-28 20:20:15,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 20:20:15,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 20:20:15,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 20:20:15,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 20:20:15,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 08:20:14" (1/3) ... [2020-07-28 20:20:15,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e781e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 08:20:15, skipping insertion in model container [2020-07-28 20:20:15,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 08:20:14" (2/3) ... [2020-07-28 20:20:15,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e781e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 08:20:15, skipping insertion in model container [2020-07-28 20:20:15,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 08:20:15" (3/3) ... [2020-07-28 20:20:15,448 INFO L109 eAbstractionObserver]: Analyzing ICFG 16_peterson.i [2020-07-28 20:20:15,458 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-07-28 20:20:15,459 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 20:20:15,466 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-07-28 20:20:15,467 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-07-28 20:20:15,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 20:20:15,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 20:20:15,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 20:20:15,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 20:20:15,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 20:20:15,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 20:20:15,499 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 20:20:15,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 20:20:15,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 20:20:15,499 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 20:20:15,518 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-28 20:20:15,538 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 20:20:15,539 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 20:20:15,539 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 20:20:15,539 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 20:20:15,540 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 20:20:15,540 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 20:20:15,540 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 20:20:15,540 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 20:20:15,555 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 51 transitions, 107 flow [2020-07-28 20:20:15,557 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 107 flow [2020-07-28 20:20:15,593 INFO L129 PetriNetUnfolder]: 6/50 cut-off events. [2020-07-28 20:20:15,593 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-07-28 20:20:15,598 INFO L80 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 6/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2020-07-28 20:20:15,600 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 107 flow [2020-07-28 20:20:15,630 INFO L129 PetriNetUnfolder]: 6/50 cut-off events. [2020-07-28 20:20:15,633 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-07-28 20:20:15,634 INFO L80 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 6/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2020-07-28 20:20:15,637 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 672 [2020-07-28 20:20:15,639 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-07-28 20:20:17,013 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1287 [2020-07-28 20:20:17,013 INFO L214 etLargeBlockEncoding]: Total number of compositions: 36 [2020-07-28 20:20:17,017 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 22 transitions, 49 flow [2020-07-28 20:20:17,031 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 66 states. [2020-07-28 20:20:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2020-07-28 20:20:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 20:20:17,040 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 20:20:17,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 20:20:17,042 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 20:20:17,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 20:20:17,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1942834628, now seen corresponding path program 1 times [2020-07-28 20:20:17,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 20:20:17,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419096560] [2020-07-28 20:20:17,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 20:20:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 20:20:17,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {184#true} [182] ULTIMATE.startENTRY-->L697: Formula: (let ((.cse0 (store |v_#valid_35| 0 0))) (and (= 0 v_~x~0_49) (= 0 v_~turn~0_68) (= 0 v_~flag2~0_49) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t~0.base_22| 4) |v_#length_9|) (< 0 |v_#StackHeapBarrier_8|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_22|)) (= |v_ULTIMATE.start_main_~#t~0.offset_14| 0) (= 0 |v_#NULL.offset_4|) (= |v_#valid_33| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_22| 1)) (= 0 v_~flag1~0_48) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t~0.base_22| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t~0.base_22|) |v_ULTIMATE.start_main_~#t~0.offset_14| 0))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t~0.base_22|) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~flag2~0=v_~flag2~0_49, #valid=|v_#valid_33|, ULTIMATE.start_main_#t~ret3.offset=|v_ULTIMATE.start_main_#t~ret3.offset_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~ret3.base=|v_ULTIMATE.start_main_#t~ret3.base_16|, ~flag1~0=v_~flag1~0_48, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_22|, #length=|v_#length_9|, ~turn~0=v_~turn~0_68, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #NULL.offset, ULTIMATE.start_main_~#t~0.offset, #NULL.base, ULTIMATE.start_main_#res, ~flag2~0, #valid, ULTIMATE.start_main_#t~ret3.offset, #memory_int, ULTIMATE.start_main_#t~ret3.base, ~flag1~0, ULTIMATE.start_main_~#t~0.base, #length, ~turn~0, ~x~0] {184#true} is VALID [2020-07-28 20:20:17,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {184#true} [146] L697-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~arg.base_3|) (= 0 v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_3| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_3|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_3, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_3|, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_3, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_3|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#in~arg.offset, thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~arg.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_#in~arg.base, thr1Thread1of1ForFork0_#res.offset] {184#true} is VALID [2020-07-28 20:20:17,228 INFO L280 TraceCheckUtils]: 2: Hoare triple {184#true} [162] thr1ENTRY-->L678: Formula: (and (= v_thr1Thread1of1ForFork0_~arg.base_4 |v_thr1Thread1of1ForFork0_#in~arg.base_4|) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_4| v_thr1Thread1of1ForFork0_~arg.offset_4) (= 1 v_~flag1~0_26)) InVars {thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_4|, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_4|} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_4|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_4, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_4, ~flag1~0=v_~flag1~0_26, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_~arg.base, ~flag1~0] {184#true} is VALID [2020-07-28 20:20:17,229 INFO L280 TraceCheckUtils]: 3: Hoare triple {184#true} [133] L678-->L679-2: Formula: (= v_~turn~0_1 1) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] {184#true} is VALID [2020-07-28 20:20:17,230 INFO L280 TraceCheckUtils]: 4: Hoare triple {184#true} [148] L679-2-->L681: Formula: false InVars {} OutVars{~x~0=v_~x~0_8} AuxVars[] AssignedVars[~x~0] {185#false} is VALID [2020-07-28 20:20:17,231 INFO L280 TraceCheckUtils]: 5: Hoare triple {185#false} [152] L681-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (<= v_~x~0_21 0)) InVars {~x~0=v_~x~0_21} OutVars{~x~0=v_~x~0_21} AuxVars[] AssignedVars[] {185#false} is VALID [2020-07-28 20:20:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 20:20:17,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419096560] [2020-07-28 20:20:17,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 20:20:17,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 20:20:17,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487112930] [2020-07-28 20:20:17,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 20:20:17,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 20:20:17,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 20:20:17,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 20:20:17,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 20:20:17,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 20:20:17,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 20:20:17,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 20:20:17,279 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2020-07-28 20:20:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:17,341 INFO L93 Difference]: Finished difference Result 66 states and 130 transitions. [2020-07-28 20:20:17,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 20:20:17,342 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 20:20:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 20:20:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 20:20:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2020-07-28 20:20:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 20:20:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2020-07-28 20:20:17,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 21 transitions. [2020-07-28 20:20:17,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 20:20:17,400 INFO L225 Difference]: With dead ends: 66 [2020-07-28 20:20:17,401 INFO L226 Difference]: Without dead ends: 62 [2020-07-28 20:20:17,402 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 20:20:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-28 20:20:17,436 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,440 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,440 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,441 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,441 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,442 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,443 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,443 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,443 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,444 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,444 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,445 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,445 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,445 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,446 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,446 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,447 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,447 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,447 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,448 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,452 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,452 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,453 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,453 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,453 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,454 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,455 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,455 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,455 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,456 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,457 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,457 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,466 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,467 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,467 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,468 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,468 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,468 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,469 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,469 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,469 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,470 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,470 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,471 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,472 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,472 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,472 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,473 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,473 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,474 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,474 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,474 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,475 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,477 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,477 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,478 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,480 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,481 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,482 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,482 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,483 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,484 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-28 20:20:17,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 20:20:17,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2020-07-28 20:20:17,486 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-28 20:20:17,486 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-28 20:20:17,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:17,494 INFO L93 Difference]: Finished difference Result 62 states and 122 transitions. [2020-07-28 20:20:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 122 transitions. [2020-07-28 20:20:17,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:17,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 20:20:17,496 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-28 20:20:17,496 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-28 20:20:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:17,503 INFO L93 Difference]: Finished difference Result 62 states and 122 transitions. [2020-07-28 20:20:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 122 transitions. [2020-07-28 20:20:17,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:17,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 20:20:17,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 20:20:17,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 20:20:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-28 20:20:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 122 transitions. [2020-07-28 20:20:17,511 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 122 transitions. Word has length 6 [2020-07-28 20:20:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 20:20:17,512 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 122 transitions. [2020-07-28 20:20:17,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 20:20:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 122 transitions. [2020-07-28 20:20:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 20:20:17,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 20:20:17,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 20:20:17,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 20:20:17,514 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 20:20:17,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 20:20:17,514 INFO L82 PathProgramCache]: Analyzing trace with hash 98318518, now seen corresponding path program 1 times [2020-07-28 20:20:17,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 20:20:17,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045296468] [2020-07-28 20:20:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 20:20:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 20:20:17,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {502#true} [182] ULTIMATE.startENTRY-->L697: Formula: (let ((.cse0 (store |v_#valid_35| 0 0))) (and (= 0 v_~x~0_49) (= 0 v_~turn~0_68) (= 0 v_~flag2~0_49) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t~0.base_22| 4) |v_#length_9|) (< 0 |v_#StackHeapBarrier_8|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_22|)) (= |v_ULTIMATE.start_main_~#t~0.offset_14| 0) (= 0 |v_#NULL.offset_4|) (= |v_#valid_33| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_22| 1)) (= 0 v_~flag1~0_48) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t~0.base_22| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t~0.base_22|) |v_ULTIMATE.start_main_~#t~0.offset_14| 0))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t~0.base_22|) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~flag2~0=v_~flag2~0_49, #valid=|v_#valid_33|, ULTIMATE.start_main_#t~ret3.offset=|v_ULTIMATE.start_main_#t~ret3.offset_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~ret3.base=|v_ULTIMATE.start_main_#t~ret3.base_16|, ~flag1~0=v_~flag1~0_48, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_22|, #length=|v_#length_9|, ~turn~0=v_~turn~0_68, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #NULL.offset, ULTIMATE.start_main_~#t~0.offset, #NULL.base, ULTIMATE.start_main_#res, ~flag2~0, #valid, ULTIMATE.start_main_#t~ret3.offset, #memory_int, ULTIMATE.start_main_#t~ret3.base, ~flag1~0, ULTIMATE.start_main_~#t~0.base, #length, ~turn~0, ~x~0] {502#true} is VALID [2020-07-28 20:20:17,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} [146] L697-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~arg.base_3|) (= 0 v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_3| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_3|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_3, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_3|, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_3, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_3|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#in~arg.offset, thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~arg.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_#in~arg.base, thr1Thread1of1ForFork0_#res.offset] {502#true} is VALID [2020-07-28 20:20:17,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#true} [162] thr1ENTRY-->L678: Formula: (and (= v_thr1Thread1of1ForFork0_~arg.base_4 |v_thr1Thread1of1ForFork0_#in~arg.base_4|) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_4| v_thr1Thread1of1ForFork0_~arg.offset_4) (= 1 v_~flag1~0_26)) InVars {thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_4|, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_4|} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_4|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_4, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_4, ~flag1~0=v_~flag1~0_26, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_~arg.base, ~flag1~0] {502#true} is VALID [2020-07-28 20:20:17,608 INFO L280 TraceCheckUtils]: 3: Hoare triple {502#true} [133] L678-->L679-2: Formula: (= v_~turn~0_1 1) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] {502#true} is VALID [2020-07-28 20:20:17,608 INFO L280 TraceCheckUtils]: 4: Hoare triple {502#true} [135] L679-2-->L679-3: Formula: (or (not (= 1 v_~flag2~0_1)) (not (= 1 v_~turn~0_2))) InVars {~turn~0=v_~turn~0_2, ~flag2~0=v_~flag2~0_1} OutVars{~turn~0=v_~turn~0_2, ~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[] {502#true} is VALID [2020-07-28 20:20:17,609 INFO L280 TraceCheckUtils]: 5: Hoare triple {502#true} [137] L679-3-->L681: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {504#(= 0 ~x~0)} is VALID [2020-07-28 20:20:17,610 INFO L280 TraceCheckUtils]: 6: Hoare triple {504#(= 0 ~x~0)} [152] L681-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (<= v_~x~0_21 0)) InVars {~x~0=v_~x~0_21} OutVars{~x~0=v_~x~0_21} AuxVars[] AssignedVars[] {503#false} is VALID [2020-07-28 20:20:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 20:20:17,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045296468] [2020-07-28 20:20:17,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 20:20:17,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 20:20:17,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100061930] [2020-07-28 20:20:17,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 20:20:17,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 20:20:17,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 20:20:17,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 20:20:17,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 20:20:17,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 20:20:17,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 20:20:17,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 20:20:17,625 INFO L87 Difference]: Start difference. First operand 62 states and 122 transitions. Second operand 3 states. [2020-07-28 20:20:17,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:17,675 INFO L93 Difference]: Finished difference Result 66 states and 121 transitions. [2020-07-28 20:20:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 20:20:17,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 20:20:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 20:20:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 20:20:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-28 20:20:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 20:20:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-28 20:20:17,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2020-07-28 20:20:17,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 20:20:17,719 INFO L225 Difference]: With dead ends: 66 [2020-07-28 20:20:17,719 INFO L226 Difference]: Without dead ends: 56 [2020-07-28 20:20:17,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 20:20:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-28 20:20:17,725 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,725 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,726 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,726 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,726 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,727 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,727 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,727 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,727 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,728 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,728 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,728 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,729 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,729 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,729 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,729 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,730 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,730 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,730 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,731 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,731 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,731 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,731 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,732 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,732 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,732 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,733 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,733 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,733 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,733 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,734 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,734 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,734 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,735 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,735 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,735 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,736 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,736 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,736 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,736 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,737 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,737 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,737 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,738 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,738 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,738 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,738 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,739 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,739 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,739 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,740 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,740 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2020-07-28 20:20:17,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 20:20:17,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 52 states. [2020-07-28 20:20:17,741 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 52 states. [2020-07-28 20:20:17,741 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 52 states. [2020-07-28 20:20:17,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:17,745 INFO L93 Difference]: Finished difference Result 56 states and 102 transitions. [2020-07-28 20:20:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2020-07-28 20:20:17,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:17,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 20:20:17,747 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 56 states. [2020-07-28 20:20:17,747 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 56 states. [2020-07-28 20:20:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:17,751 INFO L93 Difference]: Finished difference Result 56 states and 102 transitions. [2020-07-28 20:20:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2020-07-28 20:20:17,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:17,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 20:20:17,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 20:20:17,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 20:20:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-28 20:20:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 98 transitions. [2020-07-28 20:20:17,758 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 98 transitions. Word has length 7 [2020-07-28 20:20:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 20:20:17,759 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 98 transitions. [2020-07-28 20:20:17,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 20:20:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 98 transitions. [2020-07-28 20:20:17,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 20:20:17,760 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 20:20:17,760 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 20:20:17,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 20:20:17,760 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 20:20:17,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 20:20:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash 114699826, now seen corresponding path program 1 times [2020-07-28 20:20:17,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 20:20:17,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492168034] [2020-07-28 20:20:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 20:20:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 20:20:17,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {789#true} [182] ULTIMATE.startENTRY-->L697: Formula: (let ((.cse0 (store |v_#valid_35| 0 0))) (and (= 0 v_~x~0_49) (= 0 v_~turn~0_68) (= 0 v_~flag2~0_49) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t~0.base_22| 4) |v_#length_9|) (< 0 |v_#StackHeapBarrier_8|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_22|)) (= |v_ULTIMATE.start_main_~#t~0.offset_14| 0) (= 0 |v_#NULL.offset_4|) (= |v_#valid_33| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_22| 1)) (= 0 v_~flag1~0_48) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t~0.base_22| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t~0.base_22|) |v_ULTIMATE.start_main_~#t~0.offset_14| 0))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t~0.base_22|) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~flag2~0=v_~flag2~0_49, #valid=|v_#valid_33|, ULTIMATE.start_main_#t~ret3.offset=|v_ULTIMATE.start_main_#t~ret3.offset_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~ret3.base=|v_ULTIMATE.start_main_#t~ret3.base_16|, ~flag1~0=v_~flag1~0_48, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_22|, #length=|v_#length_9|, ~turn~0=v_~turn~0_68, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #NULL.offset, ULTIMATE.start_main_~#t~0.offset, #NULL.base, ULTIMATE.start_main_#res, ~flag2~0, #valid, ULTIMATE.start_main_#t~ret3.offset, #memory_int, ULTIMATE.start_main_#t~ret3.base, ~flag1~0, ULTIMATE.start_main_~#t~0.base, #length, ~turn~0, ~x~0] {789#true} is VALID [2020-07-28 20:20:17,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {789#true} [146] L697-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~arg.base_3|) (= 0 v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_3| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_3|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_3, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_3|, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_3, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_3|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#in~arg.offset, thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~arg.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_#in~arg.base, thr1Thread1of1ForFork0_#res.offset] {789#true} is VALID [2020-07-28 20:20:17,817 INFO L280 TraceCheckUtils]: 2: Hoare triple {789#true} [181] L697-1-->L687: Formula: (and (= 1 v_~flag2~0_48) (= |v_ULTIMATE.start_thr2_#in~arg.base_13| v_ULTIMATE.start_thr2_~arg.base_12) (= |v_ULTIMATE.start_thr2_#in~arg.offset_13| v_ULTIMATE.start_thr2_~arg.offset_12) (= 0 |v_ULTIMATE.start_thr2_#in~arg.base_13|) (= 0 |v_ULTIMATE.start_thr2_#in~arg.offset_13|)) InVars {} OutVars{ULTIMATE.start_thr2_#res.base=|v_ULTIMATE.start_thr2_#res.base_17|, ~flag2~0=v_~flag2~0_48, ULTIMATE.start_thr2_~arg.base=v_ULTIMATE.start_thr2_~arg.base_12, ULTIMATE.start_thr2_#in~arg.offset=|v_ULTIMATE.start_thr2_#in~arg.offset_13|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_thr2_~arg.offset=v_ULTIMATE.start_thr2_~arg.offset_12, ULTIMATE.start_thr2_#res.offset=|v_ULTIMATE.start_thr2_#res.offset_17|, ULTIMATE.start_thr2_#in~arg.base=|v_ULTIMATE.start_thr2_#in~arg.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_#res.base, ~flag2~0, ULTIMATE.start_thr2_~arg.base, ULTIMATE.start_thr2_#in~arg.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_thr2_~arg.offset, ULTIMATE.start_thr2_#res.offset, ULTIMATE.start_thr2_#in~arg.base] {789#true} is VALID [2020-07-28 20:20:17,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {789#true} [95] L687-->L688-2: Formula: (= v_~turn~0_5 0) InVars {} OutVars{~turn~0=v_~turn~0_5} AuxVars[] AssignedVars[~turn~0] {789#true} is VALID [2020-07-28 20:20:17,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {789#true} [101] L688-2-->L688-3: Formula: (or (not (= 1 v_~flag1~0_4)) (not (= 0 v_~turn~0_6))) InVars {~turn~0=v_~turn~0_6, ~flag1~0=v_~flag1~0_4} OutVars{~turn~0=v_~turn~0_6, ~flag1~0=v_~flag1~0_4} AuxVars[] AssignedVars[] {789#true} is VALID [2020-07-28 20:20:17,819 INFO L280 TraceCheckUtils]: 5: Hoare triple {789#true} [109] L688-3-->L690: Formula: (= v_~x~0_6 1) InVars {} OutVars{~x~0=v_~x~0_6} AuxVars[] AssignedVars[~x~0] {791#(= 1 ~x~0)} is VALID [2020-07-28 20:20:17,821 INFO L280 TraceCheckUtils]: 6: Hoare triple {791#(= 1 ~x~0)} [161] L690-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (<= 1 v_~x~0_32)) InVars {~x~0=v_~x~0_32} OutVars{~x~0=v_~x~0_32} AuxVars[] AssignedVars[] {790#false} is VALID [2020-07-28 20:20:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 20:20:17,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492168034] [2020-07-28 20:20:17,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 20:20:17,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 20:20:17,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214786720] [2020-07-28 20:20:17,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 20:20:17,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 20:20:17,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 20:20:17,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 20:20:17,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 20:20:17,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 20:20:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 20:20:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 20:20:17,835 INFO L87 Difference]: Start difference. First operand 52 states and 98 transitions. Second operand 3 states. [2020-07-28 20:20:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:17,902 INFO L93 Difference]: Finished difference Result 48 states and 85 transitions. [2020-07-28 20:20:17,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 20:20:17,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 20:20:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 20:20:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 20:20:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-28 20:20:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 20:20:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-28 20:20:17,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2020-07-28 20:20:17,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 20:20:17,934 INFO L225 Difference]: With dead ends: 48 [2020-07-28 20:20:17,934 INFO L226 Difference]: Without dead ends: 38 [2020-07-28 20:20:17,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 20:20:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-28 20:20:17,937 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,938 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,938 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,938 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,938 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,938 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,939 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,939 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,939 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,939 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,939 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,940 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,940 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,940 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,940 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,941 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,941 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,941 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,941 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,941 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,942 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,942 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,942 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,942 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,942 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,943 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,943 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,943 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,943 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,943 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,944 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,944 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,944 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,944 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,945 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,945 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,945 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,945 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-28 20:20:17,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 20:20:17,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-28 20:20:17,946 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-28 20:20:17,946 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-28 20:20:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:17,948 INFO L93 Difference]: Finished difference Result 38 states and 66 transitions. [2020-07-28 20:20:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 66 transitions. [2020-07-28 20:20:17,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:17,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 20:20:17,949 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-28 20:20:17,949 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-28 20:20:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:17,951 INFO L93 Difference]: Finished difference Result 38 states and 66 transitions. [2020-07-28 20:20:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 66 transitions. [2020-07-28 20:20:17,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:17,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 20:20:17,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 20:20:17,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 20:20:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-28 20:20:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 66 transitions. [2020-07-28 20:20:17,955 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 66 transitions. Word has length 7 [2020-07-28 20:20:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 20:20:17,955 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 66 transitions. [2020-07-28 20:20:17,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 20:20:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 66 transitions. [2020-07-28 20:20:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 20:20:17,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 20:20:17,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 20:20:17,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 20:20:17,956 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 20:20:17,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 20:20:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash -480213144, now seen corresponding path program 1 times [2020-07-28 20:20:17,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 20:20:17,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251057905] [2020-07-28 20:20:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 20:20:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 20:20:18,024 INFO L280 TraceCheckUtils]: 0: Hoare triple {994#true} [182] ULTIMATE.startENTRY-->L697: Formula: (let ((.cse0 (store |v_#valid_35| 0 0))) (and (= 0 v_~x~0_49) (= 0 v_~turn~0_68) (= 0 v_~flag2~0_49) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t~0.base_22| 4) |v_#length_9|) (< 0 |v_#StackHeapBarrier_8|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_22|)) (= |v_ULTIMATE.start_main_~#t~0.offset_14| 0) (= 0 |v_#NULL.offset_4|) (= |v_#valid_33| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_22| 1)) (= 0 v_~flag1~0_48) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t~0.base_22| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t~0.base_22|) |v_ULTIMATE.start_main_~#t~0.offset_14| 0))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t~0.base_22|) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~flag2~0=v_~flag2~0_49, #valid=|v_#valid_33|, ULTIMATE.start_main_#t~ret3.offset=|v_ULTIMATE.start_main_#t~ret3.offset_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~ret3.base=|v_ULTIMATE.start_main_#t~ret3.base_16|, ~flag1~0=v_~flag1~0_48, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_22|, #length=|v_#length_9|, ~turn~0=v_~turn~0_68, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #NULL.offset, ULTIMATE.start_main_~#t~0.offset, #NULL.base, ULTIMATE.start_main_#res, ~flag2~0, #valid, ULTIMATE.start_main_#t~ret3.offset, #memory_int, ULTIMATE.start_main_#t~ret3.base, ~flag1~0, ULTIMATE.start_main_~#t~0.base, #length, ~turn~0, ~x~0] {994#true} is VALID [2020-07-28 20:20:18,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {994#true} [146] L697-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~arg.base_3|) (= 0 v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_3| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_3|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_3, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_3|, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_3, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_3|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#in~arg.offset, thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~arg.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_#in~arg.base, thr1Thread1of1ForFork0_#res.offset] {994#true} is VALID [2020-07-28 20:20:18,025 INFO L280 TraceCheckUtils]: 2: Hoare triple {994#true} [162] thr1ENTRY-->L678: Formula: (and (= v_thr1Thread1of1ForFork0_~arg.base_4 |v_thr1Thread1of1ForFork0_#in~arg.base_4|) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_4| v_thr1Thread1of1ForFork0_~arg.offset_4) (= 1 v_~flag1~0_26)) InVars {thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_4|, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_4|} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_4|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_4, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_4, ~flag1~0=v_~flag1~0_26, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_~arg.base, ~flag1~0] {994#true} is VALID [2020-07-28 20:20:18,025 INFO L280 TraceCheckUtils]: 3: Hoare triple {994#true} [181] L697-1-->L687: Formula: (and (= 1 v_~flag2~0_48) (= |v_ULTIMATE.start_thr2_#in~arg.base_13| v_ULTIMATE.start_thr2_~arg.base_12) (= |v_ULTIMATE.start_thr2_#in~arg.offset_13| v_ULTIMATE.start_thr2_~arg.offset_12) (= 0 |v_ULTIMATE.start_thr2_#in~arg.base_13|) (= 0 |v_ULTIMATE.start_thr2_#in~arg.offset_13|)) InVars {} OutVars{ULTIMATE.start_thr2_#res.base=|v_ULTIMATE.start_thr2_#res.base_17|, ~flag2~0=v_~flag2~0_48, ULTIMATE.start_thr2_~arg.base=v_ULTIMATE.start_thr2_~arg.base_12, ULTIMATE.start_thr2_#in~arg.offset=|v_ULTIMATE.start_thr2_#in~arg.offset_13|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_thr2_~arg.offset=v_ULTIMATE.start_thr2_~arg.offset_12, ULTIMATE.start_thr2_#res.offset=|v_ULTIMATE.start_thr2_#res.offset_17|, ULTIMATE.start_thr2_#in~arg.base=|v_ULTIMATE.start_thr2_#in~arg.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_#res.base, ~flag2~0, ULTIMATE.start_thr2_~arg.base, ULTIMATE.start_thr2_#in~arg.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_thr2_~arg.offset, ULTIMATE.start_thr2_#res.offset, ULTIMATE.start_thr2_#in~arg.base] {996#(= 1 ~flag2~0)} is VALID [2020-07-28 20:20:18,026 INFO L280 TraceCheckUtils]: 4: Hoare triple {996#(= 1 ~flag2~0)} [133] L678-->L679-2: Formula: (= v_~turn~0_1 1) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] {997#(and (= 1 ~turn~0) (= 1 ~flag2~0))} is VALID [2020-07-28 20:20:18,027 INFO L280 TraceCheckUtils]: 5: Hoare triple {997#(and (= 1 ~turn~0) (= 1 ~flag2~0))} [135] L679-2-->L679-3: Formula: (or (not (= 1 v_~flag2~0_1)) (not (= 1 v_~turn~0_2))) InVars {~turn~0=v_~turn~0_2, ~flag2~0=v_~flag2~0_1} OutVars{~turn~0=v_~turn~0_2, ~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[] {995#false} is VALID [2020-07-28 20:20:18,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {995#false} [137] L679-3-->L681: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {995#false} is VALID [2020-07-28 20:20:18,027 INFO L280 TraceCheckUtils]: 7: Hoare triple {995#false} [95] L687-->L688-2: Formula: (= v_~turn~0_5 0) InVars {} OutVars{~turn~0=v_~turn~0_5} AuxVars[] AssignedVars[~turn~0] {995#false} is VALID [2020-07-28 20:20:18,028 INFO L280 TraceCheckUtils]: 8: Hoare triple {995#false} [101] L688-2-->L688-3: Formula: (or (not (= 1 v_~flag1~0_4)) (not (= 0 v_~turn~0_6))) InVars {~turn~0=v_~turn~0_6, ~flag1~0=v_~flag1~0_4} OutVars{~turn~0=v_~turn~0_6, ~flag1~0=v_~flag1~0_4} AuxVars[] AssignedVars[] {995#false} is VALID [2020-07-28 20:20:18,028 INFO L280 TraceCheckUtils]: 9: Hoare triple {995#false} [109] L688-3-->L690: Formula: (= v_~x~0_6 1) InVars {} OutVars{~x~0=v_~x~0_6} AuxVars[] AssignedVars[~x~0] {995#false} is VALID [2020-07-28 20:20:18,029 INFO L280 TraceCheckUtils]: 10: Hoare triple {995#false} [152] L681-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (<= v_~x~0_21 0)) InVars {~x~0=v_~x~0_21} OutVars{~x~0=v_~x~0_21} AuxVars[] AssignedVars[] {995#false} is VALID [2020-07-28 20:20:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 20:20:18,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251057905] [2020-07-28 20:20:18,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 20:20:18,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 20:20:18,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248308844] [2020-07-28 20:20:18,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 20:20:18,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 20:20:18,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 20:20:18,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 20:20:18,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 20:20:18,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 20:20:18,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 20:20:18,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 20:20:18,044 INFO L87 Difference]: Start difference. First operand 38 states and 66 transitions. Second operand 4 states. [2020-07-28 20:20:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:18,101 INFO L93 Difference]: Finished difference Result 43 states and 75 transitions. [2020-07-28 20:20:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 20:20:18,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 20:20:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 20:20:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 20:20:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-28 20:20:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 20:20:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-28 20:20:18,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2020-07-28 20:20:18,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 20:20:18,137 INFO L225 Difference]: With dead ends: 43 [2020-07-28 20:20:18,137 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 20:20:18,138 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 20:20:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 20:20:18,140 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,140 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,141 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,141 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,141 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,141 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,141 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,142 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,142 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,142 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,143 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,143 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,143 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,143 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,145 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,145 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,145 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,146 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,146 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,146 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,146 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,147 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,147 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,147 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,148 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,148 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,148 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,148 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,149 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,149 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 20:20:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-28 20:20:18,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 20:20:18,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2020-07-28 20:20:18,150 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-28 20:20:18,150 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-28 20:20:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:18,152 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2020-07-28 20:20:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 53 transitions. [2020-07-28 20:20:18,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:18,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 20:20:18,153 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-28 20:20:18,153 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-28 20:20:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:18,155 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2020-07-28 20:20:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 53 transitions. [2020-07-28 20:20:18,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:18,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 20:20:18,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 20:20:18,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 20:20:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-28 20:20:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 53 transitions. [2020-07-28 20:20:18,158 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 53 transitions. Word has length 11 [2020-07-28 20:20:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 20:20:18,159 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 53 transitions. [2020-07-28 20:20:18,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 20:20:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 53 transitions. [2020-07-28 20:20:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 20:20:18,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 20:20:18,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 20:20:18,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 20:20:18,160 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 20:20:18,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 20:20:18,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1657399704, now seen corresponding path program 2 times [2020-07-28 20:20:18,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 20:20:18,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436153891] [2020-07-28 20:20:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 20:20:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 20:20:18,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {1179#true} [182] ULTIMATE.startENTRY-->L697: Formula: (let ((.cse0 (store |v_#valid_35| 0 0))) (and (= 0 v_~x~0_49) (= 0 v_~turn~0_68) (= 0 v_~flag2~0_49) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t~0.base_22| 4) |v_#length_9|) (< 0 |v_#StackHeapBarrier_8|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_22|)) (= |v_ULTIMATE.start_main_~#t~0.offset_14| 0) (= 0 |v_#NULL.offset_4|) (= |v_#valid_33| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_22| 1)) (= 0 v_~flag1~0_48) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t~0.base_22| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t~0.base_22|) |v_ULTIMATE.start_main_~#t~0.offset_14| 0))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t~0.base_22|) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~flag2~0=v_~flag2~0_49, #valid=|v_#valid_33|, ULTIMATE.start_main_#t~ret3.offset=|v_ULTIMATE.start_main_#t~ret3.offset_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~ret3.base=|v_ULTIMATE.start_main_#t~ret3.base_16|, ~flag1~0=v_~flag1~0_48, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_22|, #length=|v_#length_9|, ~turn~0=v_~turn~0_68, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #NULL.offset, ULTIMATE.start_main_~#t~0.offset, #NULL.base, ULTIMATE.start_main_#res, ~flag2~0, #valid, ULTIMATE.start_main_#t~ret3.offset, #memory_int, ULTIMATE.start_main_#t~ret3.base, ~flag1~0, ULTIMATE.start_main_~#t~0.base, #length, ~turn~0, ~x~0] {1179#true} is VALID [2020-07-28 20:20:18,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {1179#true} [146] L697-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~arg.base_3|) (= 0 v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_3| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_3|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_3, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_3|, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_3, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_3|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#in~arg.offset, thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~arg.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_#in~arg.base, thr1Thread1of1ForFork0_#res.offset] {1179#true} is VALID [2020-07-28 20:20:18,219 INFO L280 TraceCheckUtils]: 2: Hoare triple {1179#true} [162] thr1ENTRY-->L678: Formula: (and (= v_thr1Thread1of1ForFork0_~arg.base_4 |v_thr1Thread1of1ForFork0_#in~arg.base_4|) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_4| v_thr1Thread1of1ForFork0_~arg.offset_4) (= 1 v_~flag1~0_26)) InVars {thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_4|, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_4|} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_4|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_4, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_4, ~flag1~0=v_~flag1~0_26, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_~arg.base, ~flag1~0] {1181#(= 1 ~flag1~0)} is VALID [2020-07-28 20:20:18,220 INFO L280 TraceCheckUtils]: 3: Hoare triple {1181#(= 1 ~flag1~0)} [181] L697-1-->L687: Formula: (and (= 1 v_~flag2~0_48) (= |v_ULTIMATE.start_thr2_#in~arg.base_13| v_ULTIMATE.start_thr2_~arg.base_12) (= |v_ULTIMATE.start_thr2_#in~arg.offset_13| v_ULTIMATE.start_thr2_~arg.offset_12) (= 0 |v_ULTIMATE.start_thr2_#in~arg.base_13|) (= 0 |v_ULTIMATE.start_thr2_#in~arg.offset_13|)) InVars {} OutVars{ULTIMATE.start_thr2_#res.base=|v_ULTIMATE.start_thr2_#res.base_17|, ~flag2~0=v_~flag2~0_48, ULTIMATE.start_thr2_~arg.base=v_ULTIMATE.start_thr2_~arg.base_12, ULTIMATE.start_thr2_#in~arg.offset=|v_ULTIMATE.start_thr2_#in~arg.offset_13|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_thr2_~arg.offset=v_ULTIMATE.start_thr2_~arg.offset_12, ULTIMATE.start_thr2_#res.offset=|v_ULTIMATE.start_thr2_#res.offset_17|, ULTIMATE.start_thr2_#in~arg.base=|v_ULTIMATE.start_thr2_#in~arg.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_#res.base, ~flag2~0, ULTIMATE.start_thr2_~arg.base, ULTIMATE.start_thr2_#in~arg.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_thr2_~arg.offset, ULTIMATE.start_thr2_#res.offset, ULTIMATE.start_thr2_#in~arg.base] {1181#(= 1 ~flag1~0)} is VALID [2020-07-28 20:20:18,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {1181#(= 1 ~flag1~0)} [133] L678-->L679-2: Formula: (= v_~turn~0_1 1) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] {1181#(= 1 ~flag1~0)} is VALID [2020-07-28 20:20:18,221 INFO L280 TraceCheckUtils]: 5: Hoare triple {1181#(= 1 ~flag1~0)} [95] L687-->L688-2: Formula: (= v_~turn~0_5 0) InVars {} OutVars{~turn~0=v_~turn~0_5} AuxVars[] AssignedVars[~turn~0] {1182#(and (= 0 ~turn~0) (= 1 ~flag1~0))} is VALID [2020-07-28 20:20:18,222 INFO L280 TraceCheckUtils]: 6: Hoare triple {1182#(and (= 0 ~turn~0) (= 1 ~flag1~0))} [101] L688-2-->L688-3: Formula: (or (not (= 1 v_~flag1~0_4)) (not (= 0 v_~turn~0_6))) InVars {~turn~0=v_~turn~0_6, ~flag1~0=v_~flag1~0_4} OutVars{~turn~0=v_~turn~0_6, ~flag1~0=v_~flag1~0_4} AuxVars[] AssignedVars[] {1180#false} is VALID [2020-07-28 20:20:18,222 INFO L280 TraceCheckUtils]: 7: Hoare triple {1180#false} [135] L679-2-->L679-3: Formula: (or (not (= 1 v_~flag2~0_1)) (not (= 1 v_~turn~0_2))) InVars {~turn~0=v_~turn~0_2, ~flag2~0=v_~flag2~0_1} OutVars{~turn~0=v_~turn~0_2, ~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[] {1180#false} is VALID [2020-07-28 20:20:18,223 INFO L280 TraceCheckUtils]: 8: Hoare triple {1180#false} [137] L679-3-->L681: Formula: (= v_~x~0_1 0) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {1180#false} is VALID [2020-07-28 20:20:18,223 INFO L280 TraceCheckUtils]: 9: Hoare triple {1180#false} [109] L688-3-->L690: Formula: (= v_~x~0_6 1) InVars {} OutVars{~x~0=v_~x~0_6} AuxVars[] AssignedVars[~x~0] {1180#false} is VALID [2020-07-28 20:20:18,223 INFO L280 TraceCheckUtils]: 10: Hoare triple {1180#false} [152] L681-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (<= v_~x~0_21 0)) InVars {~x~0=v_~x~0_21} OutVars{~x~0=v_~x~0_21} AuxVars[] AssignedVars[] {1180#false} is VALID [2020-07-28 20:20:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 20:20:18,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436153891] [2020-07-28 20:20:18,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 20:20:18,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 20:20:18,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055200170] [2020-07-28 20:20:18,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 20:20:18,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 20:20:18,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 20:20:18,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 20:20:18,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 20:20:18,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 20:20:18,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 20:20:18,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 20:20:18,240 INFO L87 Difference]: Start difference. First operand 34 states and 53 transitions. Second operand 4 states. [2020-07-28 20:20:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:18,270 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2020-07-28 20:20:18,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 20:20:18,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 20:20:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 20:20:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 20:20:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-28 20:20:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 20:20:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-28 20:20:18,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2020-07-28 20:20:18,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 20:20:18,297 INFO L225 Difference]: With dead ends: 17 [2020-07-28 20:20:18,297 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 20:20:18,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 20:20:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 20:20:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 20:20:18,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 20:20:18,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 20:20:18,298 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 20:20:18,298 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 20:20:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:18,298 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 20:20:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 20:20:18,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:18,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 20:20:18,299 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 20:20:18,299 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 20:20:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 20:20:18,300 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 20:20:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 20:20:18,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:18,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 20:20:18,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 20:20:18,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 20:20:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 20:20:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 20:20:18,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-07-28 20:20:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 20:20:18,302 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 20:20:18,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 20:20:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 20:20:18,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 20:20:18,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 20:20:18,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 08:20:18 BasicIcfg [2020-07-28 20:20:18,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 20:20:18,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 20:20:18,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 20:20:18,308 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 20:20:18,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 08:20:15" (3/4) ... [2020-07-28 20:20:18,312 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 20:20:18,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2020-07-28 20:20:18,324 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-07-28 20:20:18,324 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 20:20:18,325 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 20:20:18,394 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 20:20:18,395 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 20:20:18,398 INFO L168 Benchmark]: Toolchain (without parser) took 4204.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2020-07-28 20:20:18,399 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 20:20:18,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2020-07-28 20:20:18,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.37 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. [2020-07-28 20:20:18,406 INFO L168 Benchmark]: Boogie Preprocessor took 26.44 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-28 20:20:18,407 INFO L168 Benchmark]: RCFGBuilder took 510.02 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2020-07-28 20:20:18,408 INFO L168 Benchmark]: TraceAbstraction took 2866.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -63.2 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2020-07-28 20:20:18,414 INFO L168 Benchmark]: Witness Printer took 87.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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2020-07-28 20:20:18,418 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 643.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.37 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 26.44 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 510.02 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2866.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -63.2 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * Witness Printer took 87.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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 49 ProgramPointsBefore, 21 ProgramPointsAfterwards, 51 TransitionsBefore, 22 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 6 FixpointIterations, 10 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 330 VarBasedMoverChecksPositive, 35 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 26 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.5s, 0 MoverChecksTotal, 1287 CheckedPairsTotal, 36 TotalNumberOfCompositions - PositiveResult [Line: 681]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 690]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.4s, HoareTripleCheckerStatistics: 93 SDtfs, 44 SDslu, 33 SDs, 0 SdLazy, 33 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...