/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:25:08,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:25:08,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:25:09,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:25:09,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:25:09,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:25:09,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:25:09,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:25:09,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:25:09,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:25:09,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:25:09,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:25:09,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:25:09,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:25:09,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:25:09,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:25:09,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:25:09,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:25:09,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:25:09,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:25:09,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:25:09,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:25:09,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:25:09,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:25:09,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:25:09,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:25:09,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:25:09,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:25:09,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:25:09,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:25:09,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:25:09,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:25:09,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:25:09,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:25:09,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:25:09,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:25:09,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:25:09,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:25:09,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:25:09,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:25:09,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:25:09,033 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:25:09,047 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:25:09,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:25:09,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:25:09,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:25:09,049 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:25:09,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:25:09,049 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:25:09,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:25:09,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:25:09,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:25:09,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:25:09,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:25:09,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:25:09,051 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:25:09,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:25:09,051 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:25:09,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:25:09,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:25:09,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:25:09,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:25:09,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:25:09,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:25:09,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:25:09,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:25:09,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:25:09,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:25:09,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:25:09,053 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:25:09,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:25:09,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:25:09,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:25:09,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:25:09,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:25:09,354 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:25:09,354 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:25:09,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i [2019-12-27 06:25:09,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f97c1433/a151343baeee4a2b97b370f0f0b831de/FLAG8b3b23ac3 [2019-12-27 06:25:10,017 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:25:10,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i [2019-12-27 06:25:10,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f97c1433/a151343baeee4a2b97b370f0f0b831de/FLAG8b3b23ac3 [2019-12-27 06:25:10,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f97c1433/a151343baeee4a2b97b370f0f0b831de [2019-12-27 06:25:10,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:25:10,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:25:10,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:25:10,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:25:10,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:25:10,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:25:10" (1/1) ... [2019-12-27 06:25:10,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:10, skipping insertion in model container [2019-12-27 06:25:10,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:25:10" (1/1) ... [2019-12-27 06:25:10,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:25:10,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:25:10,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:25:10,938 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:25:11,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:25:11,132 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:25:11,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11 WrapperNode [2019-12-27 06:25:11,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:25:11,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:25:11,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:25:11,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:25:11,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (1/1) ... [2019-12-27 06:25:11,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (1/1) ... [2019-12-27 06:25:11,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:25:11,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:25:11,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:25:11,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:25:11,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (1/1) ... [2019-12-27 06:25:11,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (1/1) ... [2019-12-27 06:25:11,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (1/1) ... [2019-12-27 06:25:11,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (1/1) ... [2019-12-27 06:25:11,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (1/1) ... [2019-12-27 06:25:11,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (1/1) ... [2019-12-27 06:25:11,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (1/1) ... [2019-12-27 06:25:11,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:25:11,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:25:11,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:25:11,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:25:11,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (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 [2019-12-27 06:25:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:25:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:25:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:25:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:25:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:25:11,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:25:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:25:11,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:25:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:25:11,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:25:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:25:11,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:25:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:25:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:25:11,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:25:11,336 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:25:12,023 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:25:12,023 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:25:12,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:25:12 BoogieIcfgContainer [2019-12-27 06:25:12,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:25:12,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:25:12,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:25:12,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:25:12,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:25:10" (1/3) ... [2019-12-27 06:25:12,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ad798a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:25:12, skipping insertion in model container [2019-12-27 06:25:12,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:25:11" (2/3) ... [2019-12-27 06:25:12,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ad798a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:25:12, skipping insertion in model container [2019-12-27 06:25:12,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:25:12" (3/3) ... [2019-12-27 06:25:12,033 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_tso.opt.i [2019-12-27 06:25:12,044 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:25:12,045 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:25:12,053 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:25:12,054 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:25:12,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,100 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,100 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,108 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,108 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,143 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,159 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,160 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,160 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,160 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,160 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,161 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,161 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,161 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,170 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,170 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,175 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,176 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,180 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,181 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,182 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,183 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,186 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:25:12,201 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:25:12,220 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:25:12,220 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:25:12,220 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:25:12,221 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:25:12,221 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:25:12,221 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:25:12,221 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:25:12,221 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:25:12,237 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 06:25:12,239 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 06:25:12,337 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 06:25:12,338 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:25:12,352 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:25:12,373 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 06:25:12,454 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 06:25:12,455 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:25:12,463 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:25:12,481 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 06:25:12,482 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:25:16,499 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 06:25:16,710 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 06:25:16,727 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45931 [2019-12-27 06:25:16,727 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 06:25:16,731 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 79 transitions [2019-12-27 06:25:18,122 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22190 states. [2019-12-27 06:25:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 22190 states. [2019-12-27 06:25:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:25:18,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:18,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:18,141 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1275249875, now seen corresponding path program 1 times [2019-12-27 06:25:18,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:18,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150808816] [2019-12-27 06:25:18,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:18,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150808816] [2019-12-27 06:25:18,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:18,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:25:18,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116933620] [2019-12-27 06:25:18,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:25:18,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:18,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:25:18,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:18,467 INFO L87 Difference]: Start difference. First operand 22190 states. Second operand 3 states. [2019-12-27 06:25:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:19,075 INFO L93 Difference]: Finished difference Result 21750 states and 93576 transitions. [2019-12-27 06:25:19,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:25:19,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:25:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:19,286 INFO L225 Difference]: With dead ends: 21750 [2019-12-27 06:25:19,286 INFO L226 Difference]: Without dead ends: 20406 [2019-12-27 06:25:19,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20406 states. [2019-12-27 06:25:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20406 to 20406. [2019-12-27 06:25:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 06:25:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 87656 transitions. [2019-12-27 06:25:21,336 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 87656 transitions. Word has length 9 [2019-12-27 06:25:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:21,338 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 87656 transitions. [2019-12-27 06:25:21,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:25:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 87656 transitions. [2019-12-27 06:25:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:25:21,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:21,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:21,352 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1986305756, now seen corresponding path program 1 times [2019-12-27 06:25:21,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:21,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150726738] [2019-12-27 06:25:21,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:21,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150726738] [2019-12-27 06:25:21,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:21,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:25:21,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127270748] [2019-12-27 06:25:21,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:25:21,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:21,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:25:21,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:25:21,510 INFO L87 Difference]: Start difference. First operand 20406 states and 87656 transitions. Second operand 4 states. [2019-12-27 06:25:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:22,320 INFO L93 Difference]: Finished difference Result 31694 states and 131120 transitions. [2019-12-27 06:25:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:25:22,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:25:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:22,488 INFO L225 Difference]: With dead ends: 31694 [2019-12-27 06:25:22,488 INFO L226 Difference]: Without dead ends: 31634 [2019-12-27 06:25:22,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:25:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31634 states. [2019-12-27 06:25:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31634 to 28582. [2019-12-27 06:25:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28582 states. [2019-12-27 06:25:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28582 states to 28582 states and 119644 transitions. [2019-12-27 06:25:25,102 INFO L78 Accepts]: Start accepts. Automaton has 28582 states and 119644 transitions. Word has length 15 [2019-12-27 06:25:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:25,102 INFO L462 AbstractCegarLoop]: Abstraction has 28582 states and 119644 transitions. [2019-12-27 06:25:25,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:25:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 28582 states and 119644 transitions. [2019-12-27 06:25:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 06:25:25,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:25,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:25,118 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:25,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:25,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2051676058, now seen corresponding path program 1 times [2019-12-27 06:25:25,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:25,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962891415] [2019-12-27 06:25:25,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:25,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962891415] [2019-12-27 06:25:25,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:25,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:25:25,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932054281] [2019-12-27 06:25:25,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:25:25,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:25,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:25:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:25:25,287 INFO L87 Difference]: Start difference. First operand 28582 states and 119644 transitions. Second operand 4 states. [2019-12-27 06:25:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:25,648 INFO L93 Difference]: Finished difference Result 35982 states and 149300 transitions. [2019-12-27 06:25:25,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:25:25,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 06:25:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:25,857 INFO L225 Difference]: With dead ends: 35982 [2019-12-27 06:25:25,857 INFO L226 Difference]: Without dead ends: 35934 [2019-12-27 06:25:25,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:25:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35934 states. [2019-12-27 06:25:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35934 to 31130. [2019-12-27 06:25:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31130 states. [2019-12-27 06:25:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31130 states to 31130 states and 130164 transitions. [2019-12-27 06:25:28,937 INFO L78 Accepts]: Start accepts. Automaton has 31130 states and 130164 transitions. Word has length 18 [2019-12-27 06:25:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:28,938 INFO L462 AbstractCegarLoop]: Abstraction has 31130 states and 130164 transitions. [2019-12-27 06:25:28,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:25:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 31130 states and 130164 transitions. [2019-12-27 06:25:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 06:25:28,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:28,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:28,949 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:28,950 INFO L82 PathProgramCache]: Analyzing trace with hash 94366494, now seen corresponding path program 1 times [2019-12-27 06:25:28,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:28,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125629964] [2019-12-27 06:25:28,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:29,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125629964] [2019-12-27 06:25:29,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:29,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:25:29,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928991987] [2019-12-27 06:25:29,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:25:29,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:29,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:25:29,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:29,024 INFO L87 Difference]: Start difference. First operand 31130 states and 130164 transitions. Second operand 3 states. [2019-12-27 06:25:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:29,183 INFO L93 Difference]: Finished difference Result 30694 states and 128328 transitions. [2019-12-27 06:25:29,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:25:29,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 06:25:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:29,293 INFO L225 Difference]: With dead ends: 30694 [2019-12-27 06:25:29,294 INFO L226 Difference]: Without dead ends: 30694 [2019-12-27 06:25:29,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30694 states. [2019-12-27 06:25:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30694 to 30694. [2019-12-27 06:25:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30694 states. [2019-12-27 06:25:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30694 states to 30694 states and 128328 transitions. [2019-12-27 06:25:30,447 INFO L78 Accepts]: Start accepts. Automaton has 30694 states and 128328 transitions. Word has length 20 [2019-12-27 06:25:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:30,447 INFO L462 AbstractCegarLoop]: Abstraction has 30694 states and 128328 transitions. [2019-12-27 06:25:30,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:25:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 30694 states and 128328 transitions. [2019-12-27 06:25:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 06:25:30,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:30,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:30,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash 831760779, now seen corresponding path program 1 times [2019-12-27 06:25:30,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:30,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105662425] [2019-12-27 06:25:30,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:30,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105662425] [2019-12-27 06:25:30,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:30,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:25:30,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907836384] [2019-12-27 06:25:30,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:25:30,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:30,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:25:30,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:30,520 INFO L87 Difference]: Start difference. First operand 30694 states and 128328 transitions. Second operand 3 states. [2019-12-27 06:25:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:30,944 INFO L93 Difference]: Finished difference Result 30650 states and 128132 transitions. [2019-12-27 06:25:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:25:30,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 06:25:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:31,046 INFO L225 Difference]: With dead ends: 30650 [2019-12-27 06:25:31,047 INFO L226 Difference]: Without dead ends: 30650 [2019-12-27 06:25:31,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30650 states. [2019-12-27 06:25:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30650 to 30650. [2019-12-27 06:25:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30650 states. [2019-12-27 06:25:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30650 states to 30650 states and 128132 transitions. [2019-12-27 06:25:32,187 INFO L78 Accepts]: Start accepts. Automaton has 30650 states and 128132 transitions. Word has length 21 [2019-12-27 06:25:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:32,187 INFO L462 AbstractCegarLoop]: Abstraction has 30650 states and 128132 transitions. [2019-12-27 06:25:32,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:25:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 30650 states and 128132 transitions. [2019-12-27 06:25:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:25:32,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:32,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:32,201 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:32,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:32,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1462742231, now seen corresponding path program 1 times [2019-12-27 06:25:32,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:32,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652040459] [2019-12-27 06:25:32,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:32,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652040459] [2019-12-27 06:25:32,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:32,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:25:32,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917372754] [2019-12-27 06:25:32,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:25:32,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:32,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:25:32,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:32,257 INFO L87 Difference]: Start difference. First operand 30650 states and 128132 transitions. Second operand 3 states. [2019-12-27 06:25:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:32,460 INFO L93 Difference]: Finished difference Result 45416 states and 181621 transitions. [2019-12-27 06:25:32,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:25:32,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 06:25:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:32,536 INFO L225 Difference]: With dead ends: 45416 [2019-12-27 06:25:32,536 INFO L226 Difference]: Without dead ends: 32472 [2019-12-27 06:25:32,537 INFO L631 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 [2019-12-27 06:25:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32472 states. [2019-12-27 06:25:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32472 to 31184. [2019-12-27 06:25:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31184 states. [2019-12-27 06:25:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31184 states to 31184 states and 116749 transitions. [2019-12-27 06:25:33,461 INFO L78 Accepts]: Start accepts. Automaton has 31184 states and 116749 transitions. Word has length 22 [2019-12-27 06:25:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:33,461 INFO L462 AbstractCegarLoop]: Abstraction has 31184 states and 116749 transitions. [2019-12-27 06:25:33,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:25:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 31184 states and 116749 transitions. [2019-12-27 06:25:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:25:33,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:33,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:33,473 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash 469546711, now seen corresponding path program 1 times [2019-12-27 06:25:33,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:33,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669169682] [2019-12-27 06:25:33,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:33,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669169682] [2019-12-27 06:25:33,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:33,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:25:33,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180615302] [2019-12-27 06:25:33,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:25:33,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:25:33,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:33,570 INFO L87 Difference]: Start difference. First operand 31184 states and 116749 transitions. Second operand 3 states. [2019-12-27 06:25:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:33,761 INFO L93 Difference]: Finished difference Result 31184 states and 115357 transitions. [2019-12-27 06:25:33,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:25:33,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 06:25:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:35,074 INFO L225 Difference]: With dead ends: 31184 [2019-12-27 06:25:35,075 INFO L226 Difference]: Without dead ends: 31184 [2019-12-27 06:25:35,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31184 states. [2019-12-27 06:25:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31184 to 30784. [2019-12-27 06:25:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30784 states. [2019-12-27 06:25:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30784 states to 30784 states and 113997 transitions. [2019-12-27 06:25:35,630 INFO L78 Accepts]: Start accepts. Automaton has 30784 states and 113997 transitions. Word has length 22 [2019-12-27 06:25:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:35,631 INFO L462 AbstractCegarLoop]: Abstraction has 30784 states and 113997 transitions. [2019-12-27 06:25:35,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:25:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 30784 states and 113997 transitions. [2019-12-27 06:25:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 06:25:35,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:35,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:35,643 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:35,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1201021632, now seen corresponding path program 1 times [2019-12-27 06:25:35,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:35,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431791593] [2019-12-27 06:25:35,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:35,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431791593] [2019-12-27 06:25:35,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:35,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:25:35,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840430314] [2019-12-27 06:25:35,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:25:35,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:35,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:25:35,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:25:35,723 INFO L87 Difference]: Start difference. First operand 30784 states and 113997 transitions. Second operand 4 states. [2019-12-27 06:25:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:35,916 INFO L93 Difference]: Finished difference Result 26303 states and 91404 transitions. [2019-12-27 06:25:35,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:25:35,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 06:25:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:35,986 INFO L225 Difference]: With dead ends: 26303 [2019-12-27 06:25:35,987 INFO L226 Difference]: Without dead ends: 24465 [2019-12-27 06:25:35,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:25:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24465 states. [2019-12-27 06:25:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24465 to 24465. [2019-12-27 06:25:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24465 states. [2019-12-27 06:25:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24465 states to 24465 states and 85880 transitions. [2019-12-27 06:25:36,704 INFO L78 Accepts]: Start accepts. Automaton has 24465 states and 85880 transitions. Word has length 23 [2019-12-27 06:25:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:36,705 INFO L462 AbstractCegarLoop]: Abstraction has 24465 states and 85880 transitions. [2019-12-27 06:25:36,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:25:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 24465 states and 85880 transitions. [2019-12-27 06:25:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:25:36,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:36,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:36,714 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:36,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:36,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1983808268, now seen corresponding path program 1 times [2019-12-27 06:25:36,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:36,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770975383] [2019-12-27 06:25:36,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:36,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770975383] [2019-12-27 06:25:36,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:36,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:25:36,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554454002] [2019-12-27 06:25:36,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:25:36,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:36,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:25:36,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:25:36,817 INFO L87 Difference]: Start difference. First operand 24465 states and 85880 transitions. Second operand 5 states. [2019-12-27 06:25:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:36,925 INFO L93 Difference]: Finished difference Result 12353 states and 38253 transitions. [2019-12-27 06:25:36,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:25:36,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 06:25:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:36,941 INFO L225 Difference]: With dead ends: 12353 [2019-12-27 06:25:36,941 INFO L226 Difference]: Without dead ends: 10902 [2019-12-27 06:25:36,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:25:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-12-27 06:25:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-12-27 06:25:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-12-27 06:25:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 33618 transitions. [2019-12-27 06:25:37,107 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 33618 transitions. Word has length 24 [2019-12-27 06:25:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:37,107 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 33618 transitions. [2019-12-27 06:25:37,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:25:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 33618 transitions. [2019-12-27 06:25:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:25:37,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:37,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:37,112 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:37,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:37,113 INFO L82 PathProgramCache]: Analyzing trace with hash 22545008, now seen corresponding path program 1 times [2019-12-27 06:25:37,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:37,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258896145] [2019-12-27 06:25:37,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:37,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258896145] [2019-12-27 06:25:37,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:37,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:25:37,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329096617] [2019-12-27 06:25:37,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:25:37,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:37,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:25:37,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:25:37,172 INFO L87 Difference]: Start difference. First operand 10902 states and 33618 transitions. Second operand 4 states. [2019-12-27 06:25:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:37,280 INFO L93 Difference]: Finished difference Result 16450 states and 50656 transitions. [2019-12-27 06:25:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:25:37,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:25:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:37,298 INFO L225 Difference]: With dead ends: 16450 [2019-12-27 06:25:37,298 INFO L226 Difference]: Without dead ends: 8773 [2019-12-27 06:25:37,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:25:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-27 06:25:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 8484. [2019-12-27 06:25:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8484 states. [2019-12-27 06:25:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 26171 transitions. [2019-12-27 06:25:37,427 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 26171 transitions. Word has length 25 [2019-12-27 06:25:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:37,427 INFO L462 AbstractCegarLoop]: Abstraction has 8484 states and 26171 transitions. [2019-12-27 06:25:37,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:25:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 26171 transitions. [2019-12-27 06:25:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:25:37,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:37,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:37,536 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1039706542, now seen corresponding path program 2 times [2019-12-27 06:25:37,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:37,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796883172] [2019-12-27 06:25:37,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:37,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796883172] [2019-12-27 06:25:37,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:37,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:25:37,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229796472] [2019-12-27 06:25:37,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:25:37,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:37,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:25:37,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:25:37,586 INFO L87 Difference]: Start difference. First operand 8484 states and 26171 transitions. Second operand 4 states. [2019-12-27 06:25:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:37,661 INFO L93 Difference]: Finished difference Result 12593 states and 38979 transitions. [2019-12-27 06:25:37,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:25:37,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:25:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:37,677 INFO L225 Difference]: With dead ends: 12593 [2019-12-27 06:25:37,677 INFO L226 Difference]: Without dead ends: 7913 [2019-12-27 06:25:37,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:25:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states. [2019-12-27 06:25:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 7425. [2019-12-27 06:25:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7425 states. [2019-12-27 06:25:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 21851 transitions. [2019-12-27 06:25:37,837 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 21851 transitions. Word has length 25 [2019-12-27 06:25:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:37,838 INFO L462 AbstractCegarLoop]: Abstraction has 7425 states and 21851 transitions. [2019-12-27 06:25:37,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:25:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 21851 transitions. [2019-12-27 06:25:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:25:37,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:37,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:37,843 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:37,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1222398540, now seen corresponding path program 3 times [2019-12-27 06:25:37,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:37,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953454809] [2019-12-27 06:25:37,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:37,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953454809] [2019-12-27 06:25:37,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:37,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:25:37,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948282768] [2019-12-27 06:25:37,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:25:37,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:37,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:25:37,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:25:37,919 INFO L87 Difference]: Start difference. First operand 7425 states and 21851 transitions. Second operand 6 states. [2019-12-27 06:25:38,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:38,023 INFO L93 Difference]: Finished difference Result 2984 states and 7748 transitions. [2019-12-27 06:25:38,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:25:38,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 06:25:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:38,029 INFO L225 Difference]: With dead ends: 2984 [2019-12-27 06:25:38,029 INFO L226 Difference]: Without dead ends: 2530 [2019-12-27 06:25:38,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:25:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-12-27 06:25:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2530. [2019-12-27 06:25:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2530 states. [2019-12-27 06:25:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 6428 transitions. [2019-12-27 06:25:38,065 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 6428 transitions. Word has length 25 [2019-12-27 06:25:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:38,065 INFO L462 AbstractCegarLoop]: Abstraction has 2530 states and 6428 transitions. [2019-12-27 06:25:38,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:25:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 6428 transitions. [2019-12-27 06:25:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:25:38,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:38,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:38,070 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:38,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:38,070 INFO L82 PathProgramCache]: Analyzing trace with hash 923857396, now seen corresponding path program 1 times [2019-12-27 06:25:38,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:38,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330284] [2019-12-27 06:25:38,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:38,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330284] [2019-12-27 06:25:38,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:38,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:25:38,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24867984] [2019-12-27 06:25:38,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:25:38,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:25:38,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:38,108 INFO L87 Difference]: Start difference. First operand 2530 states and 6428 transitions. Second operand 3 states. [2019-12-27 06:25:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:38,168 INFO L93 Difference]: Finished difference Result 3810 states and 9643 transitions. [2019-12-27 06:25:38,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:25:38,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 06:25:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:38,175 INFO L225 Difference]: With dead ends: 3810 [2019-12-27 06:25:38,175 INFO L226 Difference]: Without dead ends: 3810 [2019-12-27 06:25:38,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2019-12-27 06:25:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 2986. [2019-12-27 06:25:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2019-12-27 06:25:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 7669 transitions. [2019-12-27 06:25:38,231 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 7669 transitions. Word has length 32 [2019-12-27 06:25:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:38,232 INFO L462 AbstractCegarLoop]: Abstraction has 2986 states and 7669 transitions. [2019-12-27 06:25:38,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:25:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 7669 transitions. [2019-12-27 06:25:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:25:38,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:38,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:38,238 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:38,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:38,238 INFO L82 PathProgramCache]: Analyzing trace with hash 386347120, now seen corresponding path program 1 times [2019-12-27 06:25:38,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:38,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404865016] [2019-12-27 06:25:38,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:38,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404865016] [2019-12-27 06:25:38,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:38,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:25:38,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149034412] [2019-12-27 06:25:38,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:25:38,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:38,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:25:38,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:25:38,314 INFO L87 Difference]: Start difference. First operand 2986 states and 7669 transitions. Second operand 6 states. [2019-12-27 06:25:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:38,721 INFO L93 Difference]: Finished difference Result 5519 states and 13587 transitions. [2019-12-27 06:25:38,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:25:38,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 06:25:38,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:38,730 INFO L225 Difference]: With dead ends: 5519 [2019-12-27 06:25:38,730 INFO L226 Difference]: Without dead ends: 5336 [2019-12-27 06:25:38,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:25:38,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5336 states. [2019-12-27 06:25:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5336 to 3010. [2019-12-27 06:25:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3010 states. [2019-12-27 06:25:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 7675 transitions. [2019-12-27 06:25:38,786 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 7675 transitions. Word has length 32 [2019-12-27 06:25:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:38,786 INFO L462 AbstractCegarLoop]: Abstraction has 3010 states and 7675 transitions. [2019-12-27 06:25:38,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:25:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 7675 transitions. [2019-12-27 06:25:38,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:25:38,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:38,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:38,793 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:38,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:38,793 INFO L82 PathProgramCache]: Analyzing trace with hash 390952001, now seen corresponding path program 1 times [2019-12-27 06:25:38,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:38,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393150266] [2019-12-27 06:25:38,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:38,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393150266] [2019-12-27 06:25:38,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:38,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:25:38,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549254357] [2019-12-27 06:25:38,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:25:38,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:38,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:25:38,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:25:38,868 INFO L87 Difference]: Start difference. First operand 3010 states and 7675 transitions. Second operand 6 states. [2019-12-27 06:25:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:39,335 INFO L93 Difference]: Finished difference Result 5442 states and 13173 transitions. [2019-12-27 06:25:39,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:25:39,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 06:25:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:39,342 INFO L225 Difference]: With dead ends: 5442 [2019-12-27 06:25:39,342 INFO L226 Difference]: Without dead ends: 5244 [2019-12-27 06:25:39,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:25:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2019-12-27 06:25:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 2895. [2019-12-27 06:25:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2019-12-27 06:25:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 7266 transitions. [2019-12-27 06:25:39,387 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 7266 transitions. Word has length 33 [2019-12-27 06:25:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:39,388 INFO L462 AbstractCegarLoop]: Abstraction has 2895 states and 7266 transitions. [2019-12-27 06:25:39,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:25:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 7266 transitions. [2019-12-27 06:25:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:25:39,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:39,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:39,392 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:39,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:39,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1721626467, now seen corresponding path program 1 times [2019-12-27 06:25:39,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:39,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695608911] [2019-12-27 06:25:39,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:39,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695608911] [2019-12-27 06:25:39,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:39,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:25:39,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404255114] [2019-12-27 06:25:39,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:25:39,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:39,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:25:39,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:25:39,481 INFO L87 Difference]: Start difference. First operand 2895 states and 7266 transitions. Second operand 7 states. [2019-12-27 06:25:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:39,592 INFO L93 Difference]: Finished difference Result 2200 states and 5582 transitions. [2019-12-27 06:25:39,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:25:39,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 06:25:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:39,593 INFO L225 Difference]: With dead ends: 2200 [2019-12-27 06:25:39,593 INFO L226 Difference]: Without dead ends: 487 [2019-12-27 06:25:39,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:25:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-27 06:25:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2019-12-27 06:25:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-27 06:25:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1081 transitions. [2019-12-27 06:25:39,600 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1081 transitions. Word has length 34 [2019-12-27 06:25:39,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:39,600 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1081 transitions. [2019-12-27 06:25:39,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:25:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1081 transitions. [2019-12-27 06:25:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:25:39,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:39,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:39,602 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:39,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1659981285, now seen corresponding path program 1 times [2019-12-27 06:25:39,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:39,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649722646] [2019-12-27 06:25:39,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:39,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649722646] [2019-12-27 06:25:39,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:39,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:25:39,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130153962] [2019-12-27 06:25:39,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:25:39,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:39,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:25:39,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:25:39,694 INFO L87 Difference]: Start difference. First operand 481 states and 1081 transitions. Second operand 7 states. [2019-12-27 06:25:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:39,884 INFO L93 Difference]: Finished difference Result 912 states and 2005 transitions. [2019-12-27 06:25:39,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:25:39,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 06:25:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:39,886 INFO L225 Difference]: With dead ends: 912 [2019-12-27 06:25:39,887 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 06:25:39,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:25:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 06:25:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 548. [2019-12-27 06:25:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 06:25:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1194 transitions. [2019-12-27 06:25:39,899 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1194 transitions. Word has length 48 [2019-12-27 06:25:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:39,899 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1194 transitions. [2019-12-27 06:25:39,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:25:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1194 transitions. [2019-12-27 06:25:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:25:39,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:39,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:39,901 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1305532347, now seen corresponding path program 2 times [2019-12-27 06:25:39,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:39,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982598440] [2019-12-27 06:25:39,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:25:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:25:40,040 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:25:40,040 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:25:40,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= v_~b~0_13 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1053~0.base_29| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1053~0.base_29|) |v_ULTIMATE.start_main_~#t1053~0.offset_22| 0)) |v_#memory_int_25|) (= 0 v_~z$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_25) (= v_~z$w_buff0_used~0_92 0) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~z$r_buff0_thd1~0_10 0) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y~0_17 0) (= v_~main$tmp_guard0~0_12 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1053~0.base_29|) (= 0 v_~z$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_29|) 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1053~0.base_29| 4)) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~z$read_delayed~0_6 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_29| 1)) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$w_buff0~0_24) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 v_~z$w_buff1_used~0_61) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_66 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~z$r_buff1_thd3~0_43) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x~0_12 0) (= v_~z~0_20 0) (= v_~z$r_buff0_thd0~0_23 0) (= 0 |v_ULTIMATE.start_main_~#t1053~0.offset_22|) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1053~0.offset=|v_ULTIMATE.start_main_~#t1053~0.offset_22|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ULTIMATE.start_main_~#t1053~0.base=|v_ULTIMATE.start_main_~#t1053~0.base_29|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_15|, ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_12, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ~b~0=v_~b~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_20, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_23|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1053~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1053~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1055~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1056~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1054~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1055~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1054~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:25:40,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1054~0.base_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1054~0.base_11| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1054~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1054~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11|) |v_ULTIMATE.start_main_~#t1054~0.offset_10| 1)) |v_#memory_int_19|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1054~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1054~0.base] because there is no mapped edge [2019-12-27 06:25:40,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1055~0.base_12|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12|) |v_ULTIMATE.start_main_~#t1055~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t1055~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1055~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1055~0.base_12| 0)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1055~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1055~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:25:40,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1056~0.offset_10|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1056~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1056~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12|) |v_ULTIMATE.start_main_~#t1056~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1056~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_10|, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1056~0.base] because there is no mapped edge [2019-12-27 06:25:40,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L4-->L820: Formula: (and (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-254950285 0)) (= 1 ~a~0_Out-254950285) (= ~__unbuffered_p3_EAX~0_Out-254950285 ~a~0_Out-254950285) (= ~z$r_buff1_thd0~0_Out-254950285 ~z$r_buff0_thd0~0_In-254950285) (= ~z$r_buff0_thd2~0_In-254950285 ~z$r_buff1_thd2~0_Out-254950285) (= ~z$r_buff0_thd1~0_In-254950285 ~z$r_buff1_thd1~0_Out-254950285) (= ~z$r_buff0_thd4~0_In-254950285 ~z$r_buff1_thd4~0_Out-254950285) (= ~b~0_In-254950285 ~__unbuffered_p3_EBX~0_Out-254950285) (= ~z$r_buff1_thd3~0_Out-254950285 ~z$r_buff0_thd3~0_In-254950285) (= 1 ~z$r_buff0_thd4~0_Out-254950285)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-254950285, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-254950285, ~b~0=~b~0_In-254950285, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-254950285, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-254950285, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-254950285, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-254950285} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-254950285, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-254950285, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-254950285, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-254950285, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-254950285, ~a~0=~a~0_Out-254950285, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-254950285, ~b~0=~b~0_In-254950285, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-254950285, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-254950285, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-254950285, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-254950285, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-254950285, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-254950285, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-254950285} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 06:25:40,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= 1 v_~b~0_8) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_8) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~b~0=v_~b~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 06:25:40,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 1 v_~x~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 1 v_~y~0_8) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_8, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 06:25:40,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1790763758 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_In1790763758| |P2Thread1of1ForFork1_#t~ite8_Out1790763758|) (not .cse0) (= ~z$w_buff0~0_In1790763758 |P2Thread1of1ForFork1_#t~ite9_Out1790763758|)) (and (= ~z$w_buff0~0_In1790763758 |P2Thread1of1ForFork1_#t~ite8_Out1790763758|) (= |P2Thread1of1ForFork1_#t~ite9_Out1790763758| |P2Thread1of1ForFork1_#t~ite8_Out1790763758|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1790763758 256)))) (or (and (= (mod ~z$w_buff1_used~0_In1790763758 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1790763758 256)) (and (= (mod ~z$r_buff1_thd3~0_In1790763758 256) 0) .cse1)))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1790763758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1790763758, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1790763758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1790763758, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1790763758, ~weak$$choice2~0=~weak$$choice2~0_In1790763758, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In1790763758|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1790763758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1790763758, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1790763758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1790763758, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1790763758, ~weak$$choice2~0=~weak$$choice2~0_In1790763758, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out1790763758|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1790763758|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:25:40,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1143497594 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite11_In1143497594| |P2Thread1of1ForFork1_#t~ite11_Out1143497594|) (= |P2Thread1of1ForFork1_#t~ite12_Out1143497594| ~z$w_buff1~0_In1143497594)) (and (= |P2Thread1of1ForFork1_#t~ite11_Out1143497594| ~z$w_buff1~0_In1143497594) (= |P2Thread1of1ForFork1_#t~ite11_Out1143497594| |P2Thread1of1ForFork1_#t~ite12_Out1143497594|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1143497594 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1143497594 256)) .cse1) (= (mod ~z$w_buff0_used~0_In1143497594 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In1143497594 256) 0)))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1143497594, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1143497594, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1143497594|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1143497594, ~z$w_buff1~0=~z$w_buff1~0_In1143497594, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1143497594, ~weak$$choice2~0=~weak$$choice2~0_In1143497594} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1143497594, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1143497594|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1143497594, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1143497594|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1143497594, ~z$w_buff1~0=~z$w_buff1~0_In1143497594, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1143497594, ~weak$$choice2~0=~weak$$choice2~0_In1143497594} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:25:40,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1619037448 256)))) (or (and (not .cse0) (= ~z$w_buff0_used~0_In1619037448 |P2Thread1of1ForFork1_#t~ite15_Out1619037448|) (= |P2Thread1of1ForFork1_#t~ite14_In1619037448| |P2Thread1of1ForFork1_#t~ite14_Out1619037448|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1619037448 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1619037448 256) 0)) (= (mod ~z$w_buff0_used~0_In1619037448 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1619037448 256))))) .cse0 (= |P2Thread1of1ForFork1_#t~ite14_Out1619037448| |P2Thread1of1ForFork1_#t~ite15_Out1619037448|) (= |P2Thread1of1ForFork1_#t~ite14_Out1619037448| ~z$w_buff0_used~0_In1619037448)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1619037448|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1619037448, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1619037448, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1619037448, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1619037448, ~weak$$choice2~0=~weak$$choice2~0_In1619037448} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1619037448|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1619037448|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1619037448, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1619037448, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1619037448, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1619037448, ~weak$$choice2~0=~weak$$choice2~0_In1619037448} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 06:25:40,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 06:25:40,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In993726451 256)))) (or (and (not .cse0) (= ~z$r_buff1_thd3~0_In993726451 |P2Thread1of1ForFork1_#t~ite24_Out993726451|) (= |P2Thread1of1ForFork1_#t~ite23_In993726451| |P2Thread1of1ForFork1_#t~ite23_Out993726451|)) (and (= |P2Thread1of1ForFork1_#t~ite24_Out993726451| |P2Thread1of1ForFork1_#t~ite23_Out993726451|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In993726451 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In993726451 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In993726451 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In993726451 256) 0)))) .cse0 (= ~z$r_buff1_thd3~0_In993726451 |P2Thread1of1ForFork1_#t~ite23_Out993726451|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In993726451, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In993726451, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In993726451|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In993726451, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In993726451, ~weak$$choice2~0=~weak$$choice2~0_In993726451} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out993726451|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In993726451, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In993726451, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out993726451|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In993726451, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In993726451, ~weak$$choice2~0=~weak$$choice2~0_In993726451} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 06:25:40,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_13 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:25:40,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-824405881 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-824405881 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out-824405881| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-824405881 |P3Thread1of1ForFork2_#t~ite28_Out-824405881|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-824405881, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-824405881} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-824405881|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-824405881, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-824405881} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 06:25:40,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In516088963 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In516088963 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In516088963 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In516088963 256)))) (or (and (= ~z$w_buff1_used~0_In516088963 |P3Thread1of1ForFork2_#t~ite29_Out516088963|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out516088963|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In516088963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In516088963, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In516088963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In516088963} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out516088963|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In516088963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In516088963, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In516088963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In516088963} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 06:25:40,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2125545035 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2125545035 256)))) (or (and (= ~z$r_buff0_thd4~0_Out2125545035 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out2125545035 ~z$r_buff0_thd4~0_In2125545035) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2125545035, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2125545035} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2125545035, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2125545035, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out2125545035|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 06:25:40,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-441646162 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-441646162 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-441646162 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-441646162 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-441646162 |P3Thread1of1ForFork2_#t~ite31_Out-441646162|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-441646162|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-441646162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-441646162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-441646162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-441646162} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-441646162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-441646162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-441646162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-441646162, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-441646162|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:25:40,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_16) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:25:40,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_63 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:25:40,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1276583550 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1276583550 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite36_Out1276583550| |ULTIMATE.start_main_#t~ite37_Out1276583550|))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In1276583550 |ULTIMATE.start_main_#t~ite36_Out1276583550|) (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~z~0_In1276583550 |ULTIMATE.start_main_#t~ite36_Out1276583550|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1276583550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1276583550, ~z$w_buff1~0=~z$w_buff1~0_In1276583550, ~z~0=~z~0_In1276583550} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1276583550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1276583550, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1276583550|, ~z$w_buff1~0=~z$w_buff1~0_In1276583550, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1276583550|, ~z~0=~z~0_In1276583550} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 06:25:40,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1314515235 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1314515235 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1314515235| ~z$w_buff0_used~0_In1314515235)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1314515235| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1314515235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1314515235} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1314515235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1314515235, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1314515235|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:25:40,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In490922796 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In490922796 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In490922796 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In490922796 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out490922796| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In490922796 |ULTIMATE.start_main_#t~ite39_Out490922796|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In490922796, ~z$w_buff0_used~0=~z$w_buff0_used~0_In490922796, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In490922796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In490922796} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In490922796, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out490922796|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In490922796, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In490922796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In490922796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:25:40,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2009394970 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2009394970 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-2009394970| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-2009394970 |ULTIMATE.start_main_#t~ite40_Out-2009394970|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2009394970, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2009394970} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2009394970, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2009394970|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2009394970} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:25:40,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In61684512 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In61684512 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In61684512 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In61684512 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out61684512| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite41_Out61684512| ~z$r_buff1_thd0~0_In61684512) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In61684512, ~z$w_buff0_used~0=~z$w_buff0_used~0_In61684512, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In61684512, ~z$w_buff1_used~0=~z$w_buff1_used~0_In61684512} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out61684512|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In61684512, ~z$w_buff0_used~0=~z$w_buff0_used~0_In61684512, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In61684512, ~z$w_buff1_used~0=~z$w_buff1_used~0_In61684512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 06:25:40,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= 1 v_~__unbuffered_p3_EAX~0_10)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:25:40,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:25:40 BasicIcfg [2019-12-27 06:25:40,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:25:40,195 INFO L168 Benchmark]: Toolchain (without parser) took 29907.00 ms. Allocated memory was 144.2 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 100.6 MB in the beginning and 620.5 MB in the end (delta: -519.9 MB). Peak memory consumption was 846.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:25:40,196 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 06:25:40,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.85 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 152.9 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:25:40,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.63 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:25:40,198 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 148.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:25:40,199 INFO L168 Benchmark]: RCFGBuilder took 763.94 ms. Allocated memory is still 201.3 MB. Free memory was 148.0 MB in the beginning and 101.6 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:25:40,200 INFO L168 Benchmark]: TraceAbstraction took 28167.55 ms. Allocated memory was 201.3 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.9 MB in the beginning and 620.5 MB in the end (delta: -519.5 MB). Peak memory consumption was 790.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:25:40,203 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 840.85 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 152.9 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.63 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.38 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 148.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.94 ms. Allocated memory is still 201.3 MB. Free memory was 148.0 MB in the beginning and 101.6 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28167.55 ms. Allocated memory was 201.3 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.9 MB in the beginning and 620.5 MB in the end (delta: -519.5 MB). Peak memory consumption was 790.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 170 ProgramPointsBefore, 75 ProgramPointsAfterwards, 192 TransitionsBefore, 79 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 23 ChoiceCompositions, 5608 VarBasedMoverChecksPositive, 130 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 45931 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1053, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1054, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1055, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1056, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1808 SDtfs, 2623 SDslu, 2901 SDs, 0 SdLazy, 1071 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31184occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 15884 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 33075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...