/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/mix051_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:44:45,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:44:45,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:44:45,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:44:45,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:44:45,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:44:45,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:44:45,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:44:45,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:44:45,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:44:45,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:44:45,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:44:45,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:44:45,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:44:45,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:44:45,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:44:45,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:44:45,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:44:45,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:44:45,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:44:45,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:44:45,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:44:45,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:44:45,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:44:45,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:44:45,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:44:45,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:44:45,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:44:45,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:44:45,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:44:45,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:44:45,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:44:45,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:44:45,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:44:45,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:44:45,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:44:45,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:44:45,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:44:45,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:44:45,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:44:45,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:44:45,088 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-18 21:44:45,111 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:44:45,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:44:45,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:44:45,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:44:45,115 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:44:45,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:44:45,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:44:45,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:44:45,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:44:45,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:44:45,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:44:45,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:44:45,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:44:45,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:44:45,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:44:45,117 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:44:45,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:44:45,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:44:45,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:44:45,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:44:45,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:44:45,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:44:45,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:44:45,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:44:45,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:44:45,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:44:45,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:44:45,119 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:44:45,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:44:45,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:44:45,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:44:45,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:44:45,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:44:45,412 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:44:45,412 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:44:45,413 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.opt.i [2019-12-18 21:44:45,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb72a0c90/0597a30585f040258c271219ddd2216b/FLAG5654e822a [2019-12-18 21:44:45,978 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:44:45,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.opt.i [2019-12-18 21:44:45,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb72a0c90/0597a30585f040258c271219ddd2216b/FLAG5654e822a [2019-12-18 21:44:46,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb72a0c90/0597a30585f040258c271219ddd2216b [2019-12-18 21:44:46,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:44:46,322 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:44:46,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:44:46,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:44:46,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:44:46,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:44:46" (1/1) ... [2019-12-18 21:44:46,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:46, skipping insertion in model container [2019-12-18 21:44:46,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:44:46" (1/1) ... [2019-12-18 21:44:46,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:44:46,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:44:46,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:44:46,976 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:44:47,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:44:47,136 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:44:47,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47 WrapperNode [2019-12-18 21:44:47,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:44:47,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:44:47,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:44:47,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:44:47,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (1/1) ... [2019-12-18 21:44:47,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (1/1) ... [2019-12-18 21:44:47,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:44:47,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:44:47,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:44:47,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:44:47,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (1/1) ... [2019-12-18 21:44:47,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (1/1) ... [2019-12-18 21:44:47,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (1/1) ... [2019-12-18 21:44:47,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (1/1) ... [2019-12-18 21:44:47,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (1/1) ... [2019-12-18 21:44:47,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (1/1) ... [2019-12-18 21:44:47,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (1/1) ... [2019-12-18 21:44:47,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:44:47,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:44:47,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:44:47,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:44:47,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (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-18 21:44:47,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:44:47,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:44:47,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:44:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:44:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:44:47,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:44:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:44:47,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:44:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:44:47,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:44:47,313 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:44:47,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:44:47,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:44:47,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:44:47,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:44:47,315 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:44:47,971 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:44:47,971 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:44:47,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:44:47 BoogieIcfgContainer [2019-12-18 21:44:47,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:44:47,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:44:47,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:44:47,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:44:47,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:44:46" (1/3) ... [2019-12-18 21:44:47,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502966b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:44:47, skipping insertion in model container [2019-12-18 21:44:47,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:47" (2/3) ... [2019-12-18 21:44:47,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502966b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:44:47, skipping insertion in model container [2019-12-18 21:44:47,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:44:47" (3/3) ... [2019-12-18 21:44:47,982 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_tso.opt.i [2019-12-18 21:44:47,992 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:44:47,992 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:44:48,001 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:44:48,002 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:44:48,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,044 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,044 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,046 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,046 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,049 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,049 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,098 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,098 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,098 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,098 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,099 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,109 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,111 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,116 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,116 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,116 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,116 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,117 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,117 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,118 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,118 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,123 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,123 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:48,138 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:44:48,158 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:44:48,159 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:44:48,159 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:44:48,159 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:44:48,159 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:44:48,159 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:44:48,159 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:44:48,160 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:44:48,177 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 190 transitions [2019-12-18 21:44:48,179 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-18 21:44:48,282 INFO L126 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-18 21:44:48,282 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:44:48,304 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/161 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:44:48,327 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-18 21:44:48,408 INFO L126 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-18 21:44:48,408 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:44:48,417 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/161 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:44:48,437 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 21:44:48,438 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:44:51,300 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-18 21:44:52,195 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 21:44:52,365 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 21:44:52,387 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49357 [2019-12-18 21:44:52,387 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 21:44:52,391 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 85 transitions [2019-12-18 21:44:54,048 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26346 states. [2019-12-18 21:44:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 26346 states. [2019-12-18 21:44:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:44:54,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:54,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:44:54,059 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-18 21:44:54,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:54,064 INFO L82 PathProgramCache]: Analyzing trace with hash -759634439, now seen corresponding path program 1 times [2019-12-18 21:44:54,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:54,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316759845] [2019-12-18 21:44:54,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:54,404 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-18 21:44:54,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316759845] [2019-12-18 21:44:54,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:54,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:44:54,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762015559] [2019-12-18 21:44:54,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:44:54,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:54,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:44:54,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:44:54,431 INFO L87 Difference]: Start difference. First operand 26346 states. Second operand 3 states. [2019-12-18 21:44:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:55,676 INFO L93 Difference]: Finished difference Result 25258 states and 110048 transitions. [2019-12-18 21:44:55,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:44:55,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:44:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:55,917 INFO L225 Difference]: With dead ends: 25258 [2019-12-18 21:44:55,918 INFO L226 Difference]: Without dead ends: 23750 [2019-12-18 21:44:55,919 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-18 21:44:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23750 states. [2019-12-18 21:44:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23750 to 23750. [2019-12-18 21:44:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23750 states. [2019-12-18 21:44:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23750 states to 23750 states and 103328 transitions. [2019-12-18 21:44:57,132 INFO L78 Accepts]: Start accepts. Automaton has 23750 states and 103328 transitions. Word has length 9 [2019-12-18 21:44:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:57,133 INFO L462 AbstractCegarLoop]: Abstraction has 23750 states and 103328 transitions. [2019-12-18 21:44:57,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:44:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 23750 states and 103328 transitions. [2019-12-18 21:44:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:44:57,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:57,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:44:57,142 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-18 21:44:57,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:57,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1799856256, now seen corresponding path program 1 times [2019-12-18 21:44:57,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:57,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970764017] [2019-12-18 21:44:57,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:57,305 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-18 21:44:57,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970764017] [2019-12-18 21:44:57,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:57,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:44:57,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513832957] [2019-12-18 21:44:57,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:44:57,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:44:57,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:44:57,309 INFO L87 Difference]: Start difference. First operand 23750 states and 103328 transitions. Second operand 4 states. [2019-12-18 21:44:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:58,737 INFO L93 Difference]: Finished difference Result 35150 states and 147788 transitions. [2019-12-18 21:44:58,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:44:58,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:44:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:58,931 INFO L225 Difference]: With dead ends: 35150 [2019-12-18 21:44:58,931 INFO L226 Difference]: Without dead ends: 35098 [2019-12-18 21:44:58,933 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-18 21:44:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35098 states. [2019-12-18 21:45:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35098 to 31154. [2019-12-18 21:45:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31154 states. [2019-12-18 21:45:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31154 states to 31154 states and 133236 transitions. [2019-12-18 21:45:00,480 INFO L78 Accepts]: Start accepts. Automaton has 31154 states and 133236 transitions. Word has length 15 [2019-12-18 21:45:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:00,481 INFO L462 AbstractCegarLoop]: Abstraction has 31154 states and 133236 transitions. [2019-12-18 21:45:00,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:45:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 31154 states and 133236 transitions. [2019-12-18 21:45:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:45:00,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:00,487 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-18 21:45:00,487 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-18 21:45:00,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash 323486730, now seen corresponding path program 1 times [2019-12-18 21:45:00,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:00,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341805921] [2019-12-18 21:45:00,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:00,538 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-18 21:45:00,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341805921] [2019-12-18 21:45:00,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:00,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:45:00,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767586202] [2019-12-18 21:45:00,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:45:00,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:45:00,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:45:00,544 INFO L87 Difference]: Start difference. First operand 31154 states and 133236 transitions. Second operand 3 states. [2019-12-18 21:45:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:00,805 INFO L93 Difference]: Finished difference Result 41786 states and 175188 transitions. [2019-12-18 21:45:00,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:45:00,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 21:45:00,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:02,573 INFO L225 Difference]: With dead ends: 41786 [2019-12-18 21:45:02,573 INFO L226 Difference]: Without dead ends: 41786 [2019-12-18 21:45:02,574 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-18 21:45:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41786 states. [2019-12-18 21:45:03,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41786 to 33590. [2019-12-18 21:45:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33590 states. [2019-12-18 21:45:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33590 states to 33590 states and 143212 transitions. [2019-12-18 21:45:03,841 INFO L78 Accepts]: Start accepts. Automaton has 33590 states and 143212 transitions. Word has length 18 [2019-12-18 21:45:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:03,841 INFO L462 AbstractCegarLoop]: Abstraction has 33590 states and 143212 transitions. [2019-12-18 21:45:03,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:45:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 33590 states and 143212 transitions. [2019-12-18 21:45:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:45:03,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:03,849 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-18 21:45:03,850 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-18 21:45:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash 207003920, now seen corresponding path program 1 times [2019-12-18 21:45:03,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:03,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405934156] [2019-12-18 21:45:03,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:03,915 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-18 21:45:03,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405934156] [2019-12-18 21:45:03,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:03,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:45:03,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297279789] [2019-12-18 21:45:03,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:45:03,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:45:03,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:45:03,918 INFO L87 Difference]: Start difference. First operand 33590 states and 143212 transitions. Second operand 4 states. [2019-12-18 21:45:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:04,287 INFO L93 Difference]: Finished difference Result 40994 states and 171724 transitions. [2019-12-18 21:45:04,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:45:04,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 21:45:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:04,815 INFO L225 Difference]: With dead ends: 40994 [2019-12-18 21:45:04,815 INFO L226 Difference]: Without dead ends: 40954 [2019-12-18 21:45:04,815 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-18 21:45:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40954 states. [2019-12-18 21:45:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40954 to 35398. [2019-12-18 21:45:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35398 states. [2019-12-18 21:45:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35398 states to 35398 states and 150368 transitions. [2019-12-18 21:45:07,551 INFO L78 Accepts]: Start accepts. Automaton has 35398 states and 150368 transitions. Word has length 18 [2019-12-18 21:45:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:07,551 INFO L462 AbstractCegarLoop]: Abstraction has 35398 states and 150368 transitions. [2019-12-18 21:45:07,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:45:07,552 INFO L276 IsEmpty]: Start isEmpty. Operand 35398 states and 150368 transitions. [2019-12-18 21:45:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:45:07,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:07,559 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-18 21:45:07,559 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-18 21:45:07,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1335251272, now seen corresponding path program 1 times [2019-12-18 21:45:07,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:07,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401153911] [2019-12-18 21:45:07,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:07,621 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-18 21:45:07,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401153911] [2019-12-18 21:45:07,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:07,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:45:07,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553488992] [2019-12-18 21:45:07,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:45:07,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:07,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:45:07,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:45:07,623 INFO L87 Difference]: Start difference. First operand 35398 states and 150368 transitions. Second operand 4 states. [2019-12-18 21:45:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:07,992 INFO L93 Difference]: Finished difference Result 43630 states and 183012 transitions. [2019-12-18 21:45:07,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:45:07,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 21:45:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:08,100 INFO L225 Difference]: With dead ends: 43630 [2019-12-18 21:45:08,100 INFO L226 Difference]: Without dead ends: 43578 [2019-12-18 21:45:08,101 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-18 21:45:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43578 states. [2019-12-18 21:45:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43578 to 35970. [2019-12-18 21:45:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35970 states. [2019-12-18 21:45:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35970 states to 35970 states and 152956 transitions. [2019-12-18 21:45:09,240 INFO L78 Accepts]: Start accepts. Automaton has 35970 states and 152956 transitions. Word has length 18 [2019-12-18 21:45:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:09,240 INFO L462 AbstractCegarLoop]: Abstraction has 35970 states and 152956 transitions. [2019-12-18 21:45:09,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:45:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 35970 states and 152956 transitions. [2019-12-18 21:45:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 21:45:09,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:09,252 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-18 21:45:09,252 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-18 21:45:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1864435566, now seen corresponding path program 1 times [2019-12-18 21:45:09,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:09,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359515395] [2019-12-18 21:45:09,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:09,302 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-18 21:45:09,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359515395] [2019-12-18 21:45:09,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:09,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:45:09,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146844422] [2019-12-18 21:45:09,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:45:09,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:09,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:45:09,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:45:09,304 INFO L87 Difference]: Start difference. First operand 35970 states and 152956 transitions. Second operand 3 states. [2019-12-18 21:45:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:09,894 INFO L93 Difference]: Finished difference Result 35266 states and 149241 transitions. [2019-12-18 21:45:09,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:45:09,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 21:45:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:09,982 INFO L225 Difference]: With dead ends: 35266 [2019-12-18 21:45:09,983 INFO L226 Difference]: Without dead ends: 35266 [2019-12-18 21:45:09,983 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-18 21:45:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35266 states. [2019-12-18 21:45:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35266 to 35266. [2019-12-18 21:45:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35266 states. [2019-12-18 21:45:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35266 states to 35266 states and 149241 transitions. [2019-12-18 21:45:10,740 INFO L78 Accepts]: Start accepts. Automaton has 35266 states and 149241 transitions. Word has length 20 [2019-12-18 21:45:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:10,740 INFO L462 AbstractCegarLoop]: Abstraction has 35266 states and 149241 transitions. [2019-12-18 21:45:10,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:45:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 35266 states and 149241 transitions. [2019-12-18 21:45:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:45:12,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:12,545 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-18 21:45:12,545 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-18 21:45:12,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash -583435641, now seen corresponding path program 1 times [2019-12-18 21:45:12,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:12,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739043817] [2019-12-18 21:45:12,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:12,642 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-18 21:45:12,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739043817] [2019-12-18 21:45:12,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:12,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:45:12,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978622581] [2019-12-18 21:45:12,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:45:12,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:12,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:45:12,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:45:12,645 INFO L87 Difference]: Start difference. First operand 35266 states and 149241 transitions. Second operand 3 states. [2019-12-18 21:45:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:12,888 INFO L93 Difference]: Finished difference Result 43553 states and 174772 transitions. [2019-12-18 21:45:12,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:45:12,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 21:45:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:12,977 INFO L225 Difference]: With dead ends: 43553 [2019-12-18 21:45:12,977 INFO L226 Difference]: Without dead ends: 35790 [2019-12-18 21:45:12,977 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-18 21:45:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35790 states. [2019-12-18 21:45:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35790 to 35042. [2019-12-18 21:45:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35042 states. [2019-12-18 21:45:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35042 states to 35042 states and 139616 transitions. [2019-12-18 21:45:14,019 INFO L78 Accepts]: Start accepts. Automaton has 35042 states and 139616 transitions. Word has length 21 [2019-12-18 21:45:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:14,019 INFO L462 AbstractCegarLoop]: Abstraction has 35042 states and 139616 transitions. [2019-12-18 21:45:14,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:45:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 35042 states and 139616 transitions. [2019-12-18 21:45:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:45:14,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:14,031 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-18 21:45:14,031 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-18 21:45:14,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:14,031 INFO L82 PathProgramCache]: Analyzing trace with hash -359146426, now seen corresponding path program 1 times [2019-12-18 21:45:14,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:14,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006093110] [2019-12-18 21:45:14,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:14,121 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-18 21:45:14,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006093110] [2019-12-18 21:45:14,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:14,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:45:14,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433597879] [2019-12-18 21:45:14,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:45:14,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:14,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:45:14,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:45:14,125 INFO L87 Difference]: Start difference. First operand 35042 states and 139616 transitions. Second operand 5 states. [2019-12-18 21:45:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:14,276 INFO L93 Difference]: Finished difference Result 15598 states and 51058 transitions. [2019-12-18 21:45:14,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:45:14,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 21:45:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:14,306 INFO L225 Difference]: With dead ends: 15598 [2019-12-18 21:45:14,306 INFO L226 Difference]: Without dead ends: 13159 [2019-12-18 21:45:14,307 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-18 21:45:14,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13159 states. [2019-12-18 21:45:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13159 to 13159. [2019-12-18 21:45:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13159 states. [2019-12-18 21:45:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 42157 transitions. [2019-12-18 21:45:14,517 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 42157 transitions. Word has length 21 [2019-12-18 21:45:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:14,518 INFO L462 AbstractCegarLoop]: Abstraction has 13159 states and 42157 transitions. [2019-12-18 21:45:14,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:45:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 42157 transitions. [2019-12-18 21:45:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:45:14,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:14,523 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-18 21:45:14,523 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-18 21:45:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:14,524 INFO L82 PathProgramCache]: Analyzing trace with hash 697145585, now seen corresponding path program 1 times [2019-12-18 21:45:14,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:14,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923386366] [2019-12-18 21:45:14,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:14,606 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-18 21:45:14,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923386366] [2019-12-18 21:45:14,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:14,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:45:14,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720195797] [2019-12-18 21:45:14,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:45:14,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:45:14,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:45:14,609 INFO L87 Difference]: Start difference. First operand 13159 states and 42157 transitions. Second operand 6 states. [2019-12-18 21:45:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:14,714 INFO L93 Difference]: Finished difference Result 4507 states and 12985 transitions. [2019-12-18 21:45:14,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:45:14,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:45:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:14,722 INFO L225 Difference]: With dead ends: 4507 [2019-12-18 21:45:14,722 INFO L226 Difference]: Without dead ends: 3685 [2019-12-18 21:45:14,722 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-18 21:45:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2019-12-18 21:45:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3645. [2019-12-18 21:45:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3645 states. [2019-12-18 21:45:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 10431 transitions. [2019-12-18 21:45:14,782 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 10431 transitions. Word has length 22 [2019-12-18 21:45:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:14,782 INFO L462 AbstractCegarLoop]: Abstraction has 3645 states and 10431 transitions. [2019-12-18 21:45:14,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:45:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 10431 transitions. [2019-12-18 21:45:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:45:14,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:14,789 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-18 21:45:14,789 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-18 21:45:14,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:14,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1399010725, now seen corresponding path program 1 times [2019-12-18 21:45:14,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:14,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595253367] [2019-12-18 21:45:14,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:14,889 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-18 21:45:14,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595253367] [2019-12-18 21:45:14,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:14,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:45:14,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177420866] [2019-12-18 21:45:14,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:45:14,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:45:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:45:14,891 INFO L87 Difference]: Start difference. First operand 3645 states and 10431 transitions. Second operand 7 states. [2019-12-18 21:45:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:15,025 INFO L93 Difference]: Finished difference Result 2817 states and 8323 transitions. [2019-12-18 21:45:15,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:45:15,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 21:45:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:15,031 INFO L225 Difference]: With dead ends: 2817 [2019-12-18 21:45:15,031 INFO L226 Difference]: Without dead ends: 2011 [2019-12-18 21:45:15,032 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-18 21:45:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-12-18 21:45:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1891. [2019-12-18 21:45:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2019-12-18 21:45:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 5474 transitions. [2019-12-18 21:45:15,066 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 5474 transitions. Word has length 32 [2019-12-18 21:45:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:15,066 INFO L462 AbstractCegarLoop]: Abstraction has 1891 states and 5474 transitions. [2019-12-18 21:45:15,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:45:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 5474 transitions. [2019-12-18 21:45:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:45:15,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:15,072 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] [2019-12-18 21:45:15,072 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-18 21:45:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:15,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1928423407, now seen corresponding path program 1 times [2019-12-18 21:45:15,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:15,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238329465] [2019-12-18 21:45:15,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:15,159 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-18 21:45:15,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238329465] [2019-12-18 21:45:15,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:15,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:45:15,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078588592] [2019-12-18 21:45:15,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:45:15,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:45:15,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:45:15,163 INFO L87 Difference]: Start difference. First operand 1891 states and 5474 transitions. Second operand 4 states. [2019-12-18 21:45:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:15,187 INFO L93 Difference]: Finished difference Result 2893 states and 8217 transitions. [2019-12-18 21:45:15,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:45:15,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 21:45:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:15,191 INFO L225 Difference]: With dead ends: 2893 [2019-12-18 21:45:15,191 INFO L226 Difference]: Without dead ends: 1627 [2019-12-18 21:45:15,193 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-18 21:45:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2019-12-18 21:45:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2019-12-18 21:45:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1627 states. [2019-12-18 21:45:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 4632 transitions. [2019-12-18 21:45:15,216 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 4632 transitions. Word has length 47 [2019-12-18 21:45:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:15,216 INFO L462 AbstractCegarLoop]: Abstraction has 1627 states and 4632 transitions. [2019-12-18 21:45:15,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:45:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 4632 transitions. [2019-12-18 21:45:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:45:15,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:15,221 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] [2019-12-18 21:45:15,221 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-18 21:45:15,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash -761511395, now seen corresponding path program 2 times [2019-12-18 21:45:15,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:15,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828408914] [2019-12-18 21:45:15,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:15,295 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-18 21:45:15,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828408914] [2019-12-18 21:45:15,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:15,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:45:15,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967757871] [2019-12-18 21:45:15,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:45:15,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:45:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:45:15,298 INFO L87 Difference]: Start difference. First operand 1627 states and 4632 transitions. Second operand 4 states. [2019-12-18 21:45:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:15,318 INFO L93 Difference]: Finished difference Result 2003 states and 5495 transitions. [2019-12-18 21:45:15,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:45:15,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 21:45:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:15,320 INFO L225 Difference]: With dead ends: 2003 [2019-12-18 21:45:15,320 INFO L226 Difference]: Without dead ends: 421 [2019-12-18 21:45:15,320 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-18 21:45:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-12-18 21:45:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-12-18 21:45:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-18 21:45:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 942 transitions. [2019-12-18 21:45:15,326 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 942 transitions. Word has length 47 [2019-12-18 21:45:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:15,326 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 942 transitions. [2019-12-18 21:45:15,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:45:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 942 transitions. [2019-12-18 21:45:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:45:15,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:15,328 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] [2019-12-18 21:45:15,328 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-18 21:45:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash 309797789, now seen corresponding path program 3 times [2019-12-18 21:45:15,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:15,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056584874] [2019-12-18 21:45:15,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:15,409 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-18 21:45:15,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056584874] [2019-12-18 21:45:15,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:15,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:45:15,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860213880] [2019-12-18 21:45:15,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:45:15,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:15,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:45:15,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:45:15,412 INFO L87 Difference]: Start difference. First operand 421 states and 942 transitions. Second operand 7 states. [2019-12-18 21:45:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:15,604 INFO L93 Difference]: Finished difference Result 808 states and 1765 transitions. [2019-12-18 21:45:15,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:45:15,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 21:45:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:15,607 INFO L225 Difference]: With dead ends: 808 [2019-12-18 21:45:15,607 INFO L226 Difference]: Without dead ends: 544 [2019-12-18 21:45:15,608 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-18 21:45:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-18 21:45:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 484. [2019-12-18 21:45:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-18 21:45:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1050 transitions. [2019-12-18 21:45:15,619 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1050 transitions. Word has length 47 [2019-12-18 21:45:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:15,619 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1050 transitions. [2019-12-18 21:45:15,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:45:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1050 transitions. [2019-12-18 21:45:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:45:15,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:15,621 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] [2019-12-18 21:45:15,621 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-18 21:45:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash -355324541, now seen corresponding path program 4 times [2019-12-18 21:45:15,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:15,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203782798] [2019-12-18 21:45:15,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:15,725 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-18 21:45:15,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203782798] [2019-12-18 21:45:15,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:15,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:45:15,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458260267] [2019-12-18 21:45:15,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:45:15,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:15,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:45:15,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:45:15,727 INFO L87 Difference]: Start difference. First operand 484 states and 1050 transitions. Second operand 3 states. [2019-12-18 21:45:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:15,742 INFO L93 Difference]: Finished difference Result 482 states and 1045 transitions. [2019-12-18 21:45:15,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:45:15,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 21:45:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:15,744 INFO L225 Difference]: With dead ends: 482 [2019-12-18 21:45:15,744 INFO L226 Difference]: Without dead ends: 482 [2019-12-18 21:45:15,744 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-18 21:45:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-18 21:45:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-12-18 21:45:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-18 21:45:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1045 transitions. [2019-12-18 21:45:15,751 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1045 transitions. Word has length 47 [2019-12-18 21:45:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:15,752 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 1045 transitions. [2019-12-18 21:45:15,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:45:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1045 transitions. [2019-12-18 21:45:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 21:45:15,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:15,754 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-18 21:45:15,754 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-18 21:45:15,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:15,754 INFO L82 PathProgramCache]: Analyzing trace with hash -108021629, now seen corresponding path program 1 times [2019-12-18 21:45:15,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:15,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962668587] [2019-12-18 21:45:15,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:45:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:45:15,868 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:45:15,868 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:45:15,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_77| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~z$r_buff1_thd1~0_11) (= |v_#valid_75| (store .cse0 |v_ULTIMATE.start_main_~#t1381~0.base_25| 1)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1381~0.base_25|) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~z$r_buff1_thd2~0_11) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1381~0.base_25| 4)) (= v_~z$r_buff0_thd2~0_10 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd4~0_21) (= 0 v_~__unbuffered_p3_EAX~0_16) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~z$r_buff0_thd4~0_28 0) (= v_~z$r_buff0_thd3~0_70 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$r_buff1_thd0~0_22) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$mem_tmp~0_10 0) (= v_~z$w_buff0_used~0_95 0) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1381~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1381~0.base_25|) |v_ULTIMATE.start_main_~#t1381~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a~0_12 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z~0_20 0) (= v_~y~0_11 0) (= 0 v_~z$w_buff1~0_24) (= v_~x~0_19 0) (= 0 |v_ULTIMATE.start_main_~#t1381~0.offset_18|) (= 0 v_~z$w_buff1_used~0_57) (= (select .cse0 |v_ULTIMATE.start_main_~#t1381~0.base_25|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_22|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ULTIMATE.start_main_~#t1381~0.base=|v_ULTIMATE.start_main_~#t1381~0.base_25|, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ULTIMATE.start_main_~#t1384~0.base=|v_ULTIMATE.start_main_~#t1384~0.base_18|, #length=|v_#length_29|, ULTIMATE.start_main_~#t1382~0.offset=|v_ULTIMATE.start_main_~#t1382~0.offset_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~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_57, 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_~#t1382~0.base=|v_ULTIMATE.start_main_~#t1382~0.base_26|, ULTIMATE.start_main_~#t1384~0.offset=|v_ULTIMATE.start_main_~#t1384~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_~#t1383~0.base=|v_ULTIMATE.start_main_~#t1383~0.base_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~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_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_19, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_~#t1383~0.offset=|v_ULTIMATE.start_main_~#t1383~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_25, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_~#t1381~0.offset=|v_ULTIMATE.start_main_~#t1381~0.offset_18|, 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_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~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, ULTIMATE.start_main_~#t1381~0.base, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1384~0.base, #length, ULTIMATE.start_main_~#t1382~0.offset, ~__unbuffered_p2_EAX~0, ~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_~#t1382~0.base, ULTIMATE.start_main_~#t1384~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1383~0.base, ~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, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1383~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_~#t1381~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:45:15,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L833-1-->L835: Formula: (and (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1382~0.base_11| 1) |v_#valid_43|) (= 0 |v_ULTIMATE.start_main_~#t1382~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1382~0.base_11|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1382~0.base_11| 4) |v_#length_21|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1382~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1382~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1382~0.base_11|) |v_ULTIMATE.start_main_~#t1382~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1382~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1382~0.offset=|v_ULTIMATE.start_main_~#t1382~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1382~0.base=|v_ULTIMATE.start_main_~#t1382~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1382~0.offset, #length, ULTIMATE.start_main_~#t1382~0.base] because there is no mapped edge [2019-12-18 21:45:15,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1383~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1383~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1383~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1383~0.base_11|) |v_ULTIMATE.start_main_~#t1383~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1383~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1383~0.offset_10|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1383~0.base_11| 1) |v_#valid_41|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1383~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1383~0.base=|v_ULTIMATE.start_main_~#t1383~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1383~0.offset=|v_ULTIMATE.start_main_~#t1383~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1383~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1383~0.offset] because there is no mapped edge [2019-12-18 21:45:15,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1384~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1384~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1384~0.base_13|) |v_ULTIMATE.start_main_~#t1384~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1384~0.base_13| 1) |v_#valid_50|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1384~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1384~0.base_13| 4) |v_#length_23|) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1384~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1384~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1384~0.offset=|v_ULTIMATE.start_main_~#t1384~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1384~0.base=|v_ULTIMATE.start_main_~#t1384~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1384~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1384~0.base, #length] because there is no mapped edge [2019-12-18 21:45:15,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_5) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd4~0_18 v_~z$r_buff1_thd4~0_11) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_5) (= v_~z$r_buff0_thd3~0_45 v_~z$r_buff1_thd3~0_27) (= v_~__unbuffered_p3_EAX~0_5 v_~a~0_7) (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd4~0_17 1)) InVars {~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_5} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_5} AuxVars[] AssignedVars[~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] because there is no mapped edge [2019-12-18 21:45:15,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_~x~0_10 1) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= 1 v_~a~0_8) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{~a~0=v_~a~0_8, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_10, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 21:45:15,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 2 v_~x~0_8) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~__unbuffered_p1_EAX~0_5 v_~y~0_6) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_6} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_6, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 21:45:15,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1715981130 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1715981130 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork1_#t~ite28_Out1715981130|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1715981130 |P3Thread1of1ForFork1_#t~ite28_Out1715981130|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1715981130, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1715981130} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1715981130, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1715981130|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1715981130} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:45:15,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In-1341857512 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1341857512 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1341857512 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1341857512 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out-1341857512|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1341857512 |P3Thread1of1ForFork1_#t~ite29_Out-1341857512|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1341857512, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1341857512, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1341857512, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1341857512} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1341857512, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-1341857512|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1341857512, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1341857512, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1341857512} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 21:45:15,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In351801458 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In351801458 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In351801458 ~z$r_buff0_thd4~0_Out351801458)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out351801458)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In351801458, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In351801458} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In351801458, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out351801458, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out351801458|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 21:45:15,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In-373848980 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-373848980 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-373848980 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-373848980 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-373848980 |P3Thread1of1ForFork1_#t~ite31_Out-373848980|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork1_#t~ite31_Out-373848980|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-373848980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-373848980, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-373848980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-373848980} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-373848980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-373848980, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-373848980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-373848980, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-373848980|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:45:15,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L814-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~z$r_buff1_thd4~0_16 |v_P3Thread1of1ForFork1_#t~ite31_8|) (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_8|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:45:15,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L778-->L779: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~z$r_buff0_thd3~0_61 v_~z$r_buff0_thd3~0_60)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_10|, ~weak$$choice2~0=v_~weak$$choice2~0_27, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 21:45:15,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite23_Out-1257584039| |P2Thread1of1ForFork0_#t~ite24_Out-1257584039|)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1257584039 256))) (.cse5 (= (mod ~z$r_buff1_thd3~0_In-1257584039 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1257584039 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In-1257584039 256))) (.cse2 (= (mod ~weak$$choice2~0_In-1257584039 256) 0))) (or (let ((.cse4 (not .cse6))) (and (= |P2Thread1of1ForFork0_#t~ite23_Out-1257584039| |P2Thread1of1ForFork0_#t~ite22_Out-1257584039|) (= |P2Thread1of1ForFork0_#t~ite22_Out-1257584039| 0) (not .cse0) .cse1 .cse2 (or (not .cse3) .cse4) (or (not .cse5) .cse4))) (and (or (and .cse1 (= |P2Thread1of1ForFork0_#t~ite23_Out-1257584039| ~z$r_buff1_thd3~0_In-1257584039) (or .cse0 (and .cse5 .cse6) (and .cse3 .cse6)) .cse2) (and (not .cse2) (= |P2Thread1of1ForFork0_#t~ite23_Out-1257584039| |P2Thread1of1ForFork0_#t~ite23_In-1257584039|) (= ~z$r_buff1_thd3~0_In-1257584039 |P2Thread1of1ForFork0_#t~ite24_Out-1257584039|))) (= |P2Thread1of1ForFork0_#t~ite22_In-1257584039| |P2Thread1of1ForFork0_#t~ite22_Out-1257584039|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1257584039, P2Thread1of1ForFork0_#t~ite22=|P2Thread1of1ForFork0_#t~ite22_In-1257584039|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1257584039, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1257584039|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1257584039, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1257584039, ~weak$$choice2~0=~weak$$choice2~0_In-1257584039} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1257584039, P2Thread1of1ForFork0_#t~ite22=|P2Thread1of1ForFork0_#t~ite22_Out-1257584039|, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1257584039|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1257584039, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1257584039|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1257584039, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1257584039, ~weak$$choice2~0=~weak$$choice2~0_In-1257584039} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 21:45:15,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_14 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:45:15,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_65 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_6 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_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:45:15,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1496442359 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1496442359 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1496442359 |ULTIMATE.start_main_#t~ite36_Out-1496442359|)) (and (or .cse0 .cse1) (= ~z~0_In-1496442359 |ULTIMATE.start_main_#t~ite36_Out-1496442359|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1496442359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1496442359, ~z$w_buff1~0=~z$w_buff1~0_In-1496442359, ~z~0=~z~0_In-1496442359} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1496442359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1496442359, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1496442359|, ~z$w_buff1~0=~z$w_buff1~0_In-1496442359, ~z~0=~z~0_In-1496442359} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:45:15,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-18 21:45:15,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In230857068 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In230857068 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out230857068|) (not .cse1)) (and (= ~z$w_buff0_used~0_In230857068 |ULTIMATE.start_main_#t~ite38_Out230857068|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In230857068, ~z$w_buff0_used~0=~z$w_buff0_used~0_In230857068} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In230857068, ~z$w_buff0_used~0=~z$w_buff0_used~0_In230857068, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out230857068|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:45:15,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In320137106 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In320137106 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In320137106 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In320137106 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out320137106|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In320137106 |ULTIMATE.start_main_#t~ite39_Out320137106|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In320137106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In320137106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In320137106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In320137106} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In320137106, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out320137106|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In320137106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In320137106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In320137106} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:45:15,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In896956991 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In896956991 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out896956991| ~z$r_buff0_thd0~0_In896956991) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out896956991| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In896956991, ~z$w_buff0_used~0=~z$w_buff0_used~0_In896956991} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In896956991, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out896956991|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In896956991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:45:15,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-456446531 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-456446531 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-456446531 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-456446531 256)))) (or (and (= ~z$r_buff1_thd0~0_In-456446531 |ULTIMATE.start_main_#t~ite41_Out-456446531|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out-456446531| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-456446531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-456446531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-456446531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-456446531} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-456446531|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-456446531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-456446531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-456446531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-456446531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 21:45:15,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite41_14| v_~z$r_buff1_thd0~0_15) (= v_~x~0_14 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (= 0 v_~__unbuffered_p1_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= v_~main$tmp_guard1~0_11 0)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~x~0=v_~x~0_14} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~x~0=v_~x~0_14, 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-18 21:45:15,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:45:15 BasicIcfg [2019-12-18 21:45:15,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:45:15,994 INFO L168 Benchmark]: Toolchain (without parser) took 29673.81 ms. Allocated memory was 138.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 100.1 MB in the beginning and 592.5 MB in the end (delta: -492.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 21:45:15,995 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 21:45:15,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.91 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 156.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:45:15,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.23 ms. Allocated memory is still 203.4 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:45:15,997 INFO L168 Benchmark]: Boogie Preprocessor took 37.12 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:45:16,001 INFO L168 Benchmark]: RCFGBuilder took 739.55 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 105.2 MB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:45:16,001 INFO L168 Benchmark]: TraceAbstraction took 28018.15 ms. Allocated memory was 203.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 105.2 MB in the beginning and 592.5 MB in the end (delta: -487.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:45:16,007 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 813.91 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 156.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.23 ms. Allocated memory is still 203.4 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.12 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 739.55 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 105.2 MB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28018.15 ms. Allocated memory was 203.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 105.2 MB in the beginning and 592.5 MB in the end (delta: -487.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 168 ProgramPointsBefore, 78 ProgramPointsAfterwards, 190 TransitionsBefore, 85 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 20 ChoiceCompositions, 5376 VarBasedMoverChecksPositive, 128 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49357 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1381, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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] [L835] FCALL, FORK 0 pthread_create(&t1382, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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] [L837] FCALL, FORK 0 pthread_create(&t1383, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L839] FCALL, FORK 0 pthread_create(&t1384, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L794] 4 z$w_buff1 = z$w_buff0 [L795] 4 z$w_buff0 = 1 [L796] 4 z$w_buff1_used = z$w_buff0_used [L797] 4 z$w_buff0_used = (_Bool)1 [L810] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L766] 3 y = 1 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, 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] [L773] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, 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] [L810] 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) [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L773] 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) [L774] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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))=1, x=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 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)) [L775] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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))=0, x=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 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)) [L776] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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))=0, x=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 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)) [L777] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 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)) [L779] 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)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 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 [L848] 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, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1545 SDtfs, 2022 SDslu, 2300 SDs, 0 SdLazy, 636 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35970occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 26272 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 368 ConstructedInterpolants, 0 QuantifiedInterpolants, 33188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...