/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:26:18,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:26:18,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:26:18,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:26:18,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:26:18,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:26:18,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:26:18,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:26:18,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:26:18,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:26:18,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:26:18,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:26:18,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:26:18,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:26:18,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:26:18,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:26:18,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:26:18,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:26:18,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:26:18,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:26:18,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:26:18,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:26:18,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:26:18,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:26:18,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:26:18,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:26:18,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:26:18,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:26:18,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:26:18,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:26:18,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:26:18,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:26:18,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:26:18,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:26:18,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:26:18,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:26:18,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:26:18,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:26:18,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:26:18,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:26:18,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:26:18,998 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:26:19,012 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:26:19,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:26:19,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:26:19,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:26:19,014 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:26:19,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:26:19,014 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:26:19,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:26:19,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:26:19,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:26:19,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:26:19,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:26:19,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:26:19,016 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:26:19,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:26:19,016 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:26:19,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:26:19,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:26:19,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:26:19,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:26:19,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:26:19,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:26:19,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:26:19,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:26:19,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:26:19,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:26:19,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:26:19,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:26:19,019 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:26:19,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:26:19,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:26:19,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:26:19,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:26:19,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:26:19,300 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:26:19,301 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.opt.i [2019-12-18 12:26:19,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654fad4bc/e2bdbd11b24c4aa4a35b9c2dbe886d12/FLAGfdb45a507 [2019-12-18 12:26:19,901 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:26:19,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.opt.i [2019-12-18 12:26:19,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654fad4bc/e2bdbd11b24c4aa4a35b9c2dbe886d12/FLAGfdb45a507 [2019-12-18 12:26:20,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654fad4bc/e2bdbd11b24c4aa4a35b9c2dbe886d12 [2019-12-18 12:26:20,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:26:20,249 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:26:20,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:26:20,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:26:20,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:26:20,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:26:20" (1/1) ... [2019-12-18 12:26:20,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317ba546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:20, skipping insertion in model container [2019-12-18 12:26:20,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:26:20" (1/1) ... [2019-12-18 12:26:20,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:26:20,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:26:20,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:26:20,896 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:26:20,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:26:21,076 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:26:21,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21 WrapperNode [2019-12-18 12:26:21,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:26:21,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:26:21,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:26:21,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:26:21,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (1/1) ... [2019-12-18 12:26:21,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (1/1) ... [2019-12-18 12:26:21,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:26:21,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:26:21,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:26:21,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:26:21,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (1/1) ... [2019-12-18 12:26:21,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (1/1) ... [2019-12-18 12:26:21,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (1/1) ... [2019-12-18 12:26:21,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (1/1) ... [2019-12-18 12:26:21,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (1/1) ... [2019-12-18 12:26:21,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (1/1) ... [2019-12-18 12:26:21,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (1/1) ... [2019-12-18 12:26:21,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:26:21,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:26:21,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:26:21,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:26:21,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (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 12:26:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:26:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:26:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:26:21,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:26:21,278 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:26:21,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:26:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:26:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:26:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:26:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:26:21,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:26:21,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:26:21,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:26:21,285 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 12:26:22,274 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:26:22,274 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:26:22,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:26:22 BoogieIcfgContainer [2019-12-18 12:26:22,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:26:22,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:26:22,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:26:22,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:26:22,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:26:20" (1/3) ... [2019-12-18 12:26:22,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd7fbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:26:22, skipping insertion in model container [2019-12-18 12:26:22,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:21" (2/3) ... [2019-12-18 12:26:22,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd7fbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:26:22, skipping insertion in model container [2019-12-18 12:26:22,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:26:22" (3/3) ... [2019-12-18 12:26:22,290 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_tso.opt.i [2019-12-18 12:26:22,302 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:26:22,302 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:26:22,314 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:26:22,316 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:26:22,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,407 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,450 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,451 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,451 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,457 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,457 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,492 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,493 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,495 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:22,528 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:26:22,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:26:22,545 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:26:22,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:26:22,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:26:22,546 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:26:22,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:26:22,546 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:26:22,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:26:22,561 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-18 12:26:22,563 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-18 12:26:22,675 INFO L126 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-18 12:26:22,676 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:26:22,699 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 12:26:22,734 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-18 12:26:22,795 INFO L126 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-18 12:26:22,795 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:26:22,806 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 12:26:22,833 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 12:26:22,835 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:26:28,800 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:26:28,933 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:26:29,184 INFO L206 etLargeBlockEncoding]: Checked pairs total: 115591 [2019-12-18 12:26:29,184 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-12-18 12:26:29,187 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 122 transitions [2019-12-18 12:26:32,146 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39870 states. [2019-12-18 12:26:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 39870 states. [2019-12-18 12:26:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 12:26:32,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:32,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:32,155 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:32,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:32,160 INFO L82 PathProgramCache]: Analyzing trace with hash 191430122, now seen corresponding path program 1 times [2019-12-18 12:26:32,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:32,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698781590] [2019-12-18 12:26:32,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:32,454 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 12:26:32,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698781590] [2019-12-18 12:26:32,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:32,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:26:32,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793818294] [2019-12-18 12:26:32,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:32,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:32,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:32,477 INFO L87 Difference]: Start difference. First operand 39870 states. Second operand 3 states. [2019-12-18 12:26:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:33,965 INFO L93 Difference]: Finished difference Result 39574 states and 160408 transitions. [2019-12-18 12:26:33,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:33,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 12:26:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:34,259 INFO L225 Difference]: With dead ends: 39574 [2019-12-18 12:26:34,259 INFO L226 Difference]: Without dead ends: 36868 [2019-12-18 12:26:34,261 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 12:26:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36868 states. [2019-12-18 12:26:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36868 to 36868. [2019-12-18 12:26:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36868 states. [2019-12-18 12:26:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36868 states to 36868 states and 149325 transitions. [2019-12-18 12:26:36,302 INFO L78 Accepts]: Start accepts. Automaton has 36868 states and 149325 transitions. Word has length 7 [2019-12-18 12:26:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:36,304 INFO L462 AbstractCegarLoop]: Abstraction has 36868 states and 149325 transitions. [2019-12-18 12:26:36,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 36868 states and 149325 transitions. [2019-12-18 12:26:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:26:36,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:36,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:36,310 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1210424527, now seen corresponding path program 1 times [2019-12-18 12:26:36,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:36,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754542588] [2019-12-18 12:26:36,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:36,398 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 12:26:36,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754542588] [2019-12-18 12:26:36,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:36,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:36,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495305038] [2019-12-18 12:26:36,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:26:36,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:36,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:26:36,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:26:36,402 INFO L87 Difference]: Start difference. First operand 36868 states and 149325 transitions. Second operand 4 states. [2019-12-18 12:26:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:39,089 INFO L93 Difference]: Finished difference Result 58688 states and 229341 transitions. [2019-12-18 12:26:39,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:26:39,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:26:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:39,368 INFO L225 Difference]: With dead ends: 58688 [2019-12-18 12:26:39,368 INFO L226 Difference]: Without dead ends: 58658 [2019-12-18 12:26:39,369 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 12:26:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58658 states. [2019-12-18 12:26:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58658 to 56314. [2019-12-18 12:26:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56314 states. [2019-12-18 12:26:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56314 states to 56314 states and 221696 transitions. [2019-12-18 12:26:42,079 INFO L78 Accepts]: Start accepts. Automaton has 56314 states and 221696 transitions. Word has length 13 [2019-12-18 12:26:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:42,080 INFO L462 AbstractCegarLoop]: Abstraction has 56314 states and 221696 transitions. [2019-12-18 12:26:42,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:26:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 56314 states and 221696 transitions. [2019-12-18 12:26:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:26:42,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:42,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:42,086 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:42,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2049494264, now seen corresponding path program 1 times [2019-12-18 12:26:42,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:42,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509469404] [2019-12-18 12:26:42,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:42,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509469404] [2019-12-18 12:26:42,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:42,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:42,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032198073] [2019-12-18 12:26:42,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:26:42,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:26:42,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:26:42,210 INFO L87 Difference]: Start difference. First operand 56314 states and 221696 transitions. Second operand 4 states. [2019-12-18 12:26:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:42,799 INFO L93 Difference]: Finished difference Result 73686 states and 285874 transitions. [2019-12-18 12:26:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:26:42,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:26:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:43,030 INFO L225 Difference]: With dead ends: 73686 [2019-12-18 12:26:43,030 INFO L226 Difference]: Without dead ends: 73656 [2019-12-18 12:26:43,030 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 12:26:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73656 states. [2019-12-18 12:26:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73656 to 64544. [2019-12-18 12:26:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64544 states. [2019-12-18 12:26:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64544 states to 64544 states and 252987 transitions. [2019-12-18 12:26:47,826 INFO L78 Accepts]: Start accepts. Automaton has 64544 states and 252987 transitions. Word has length 16 [2019-12-18 12:26:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:47,826 INFO L462 AbstractCegarLoop]: Abstraction has 64544 states and 252987 transitions. [2019-12-18 12:26:47,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:26:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 64544 states and 252987 transitions. [2019-12-18 12:26:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 12:26:47,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:47,838 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 12:26:47,838 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:47,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:47,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1983670654, now seen corresponding path program 1 times [2019-12-18 12:26:47,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:47,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681406843] [2019-12-18 12:26:47,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:47,904 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 12:26:47,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681406843] [2019-12-18 12:26:47,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:47,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:26:47,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758567572] [2019-12-18 12:26:47,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:47,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:47,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:47,906 INFO L87 Difference]: Start difference. First operand 64544 states and 252987 transitions. Second operand 3 states. [2019-12-18 12:26:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:48,213 INFO L93 Difference]: Finished difference Result 64378 states and 252374 transitions. [2019-12-18 12:26:48,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:48,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 12:26:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:50,939 INFO L225 Difference]: With dead ends: 64378 [2019-12-18 12:26:50,939 INFO L226 Difference]: Without dead ends: 64378 [2019-12-18 12:26:50,939 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 12:26:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64378 states. [2019-12-18 12:26:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64378 to 64378. [2019-12-18 12:26:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64378 states. [2019-12-18 12:26:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64378 states to 64378 states and 252374 transitions. [2019-12-18 12:26:52,553 INFO L78 Accepts]: Start accepts. Automaton has 64378 states and 252374 transitions. Word has length 18 [2019-12-18 12:26:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:52,553 INFO L462 AbstractCegarLoop]: Abstraction has 64378 states and 252374 transitions. [2019-12-18 12:26:52,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 64378 states and 252374 transitions. [2019-12-18 12:26:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:26:52,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:52,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:52,562 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:52,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:52,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1589508715, now seen corresponding path program 1 times [2019-12-18 12:26:52,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:52,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174562625] [2019-12-18 12:26:52,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:52,626 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 12:26:52,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174562625] [2019-12-18 12:26:52,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:52,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:26:52,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43262289] [2019-12-18 12:26:52,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:52,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:52,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:52,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:52,628 INFO L87 Difference]: Start difference. First operand 64378 states and 252374 transitions. Second operand 3 states. [2019-12-18 12:26:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:53,479 INFO L93 Difference]: Finished difference Result 60640 states and 237307 transitions. [2019-12-18 12:26:53,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:53,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 12:26:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:53,627 INFO L225 Difference]: With dead ends: 60640 [2019-12-18 12:26:53,627 INFO L226 Difference]: Without dead ends: 60640 [2019-12-18 12:26:53,627 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 12:26:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60640 states. [2019-12-18 12:26:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60640 to 60640. [2019-12-18 12:26:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60640 states. [2019-12-18 12:26:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60640 states to 60640 states and 237307 transitions. [2019-12-18 12:26:55,612 INFO L78 Accepts]: Start accepts. Automaton has 60640 states and 237307 transitions. Word has length 19 [2019-12-18 12:26:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:55,613 INFO L462 AbstractCegarLoop]: Abstraction has 60640 states and 237307 transitions. [2019-12-18 12:26:55,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 60640 states and 237307 transitions. [2019-12-18 12:26:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:26:55,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:55,632 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 12:26:55,632 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:55,633 INFO L82 PathProgramCache]: Analyzing trace with hash 84396495, now seen corresponding path program 1 times [2019-12-18 12:26:55,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:55,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101471391] [2019-12-18 12:26:55,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:55,701 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 12:26:55,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101471391] [2019-12-18 12:26:55,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:55,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:26:55,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144930151] [2019-12-18 12:26:55,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:26:55,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:55,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:26:55,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:26:55,704 INFO L87 Difference]: Start difference. First operand 60640 states and 237307 transitions. Second operand 5 states. [2019-12-18 12:26:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:57,139 INFO L93 Difference]: Finished difference Result 73008 states and 281971 transitions. [2019-12-18 12:26:57,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:26:57,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:26:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:57,330 INFO L225 Difference]: With dead ends: 73008 [2019-12-18 12:26:57,330 INFO L226 Difference]: Without dead ends: 72954 [2019-12-18 12:26:57,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72954 states. [2019-12-18 12:27:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72954 to 60474. [2019-12-18 12:27:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60474 states. [2019-12-18 12:27:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60474 states to 60474 states and 236710 transitions. [2019-12-18 12:27:01,670 INFO L78 Accepts]: Start accepts. Automaton has 60474 states and 236710 transitions. Word has length 22 [2019-12-18 12:27:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:01,671 INFO L462 AbstractCegarLoop]: Abstraction has 60474 states and 236710 transitions. [2019-12-18 12:27:01,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:27:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 60474 states and 236710 transitions. [2019-12-18 12:27:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:27:01,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:01,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:01,749 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:01,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1678286889, now seen corresponding path program 1 times [2019-12-18 12:27:01,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:01,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125141982] [2019-12-18 12:27:01,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:01,862 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 12:27:01,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125141982] [2019-12-18 12:27:01,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:01,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:27:01,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622248713] [2019-12-18 12:27:01,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:01,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:01,864 INFO L87 Difference]: Start difference. First operand 60474 states and 236710 transitions. Second operand 3 states. [2019-12-18 12:27:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:02,130 INFO L93 Difference]: Finished difference Result 60474 states and 233922 transitions. [2019-12-18 12:27:02,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:02,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 12:27:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:02,271 INFO L225 Difference]: With dead ends: 60474 [2019-12-18 12:27:02,271 INFO L226 Difference]: Without dead ends: 60474 [2019-12-18 12:27:02,271 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 12:27:03,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60474 states. [2019-12-18 12:27:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60474 to 60154. [2019-12-18 12:27:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60154 states. [2019-12-18 12:27:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60154 states to 60154 states and 232834 transitions. [2019-12-18 12:27:04,163 INFO L78 Accepts]: Start accepts. Automaton has 60154 states and 232834 transitions. Word has length 33 [2019-12-18 12:27:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:04,163 INFO L462 AbstractCegarLoop]: Abstraction has 60154 states and 232834 transitions. [2019-12-18 12:27:04,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 60154 states and 232834 transitions. [2019-12-18 12:27:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:27:07,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:07,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:07,025 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1668508412, now seen corresponding path program 1 times [2019-12-18 12:27:07,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:07,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471304181] [2019-12-18 12:27:07,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:07,154 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 12:27:07,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471304181] [2019-12-18 12:27:07,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:07,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:27:07,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254487812] [2019-12-18 12:27:07,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:27:07,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:27:07,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:27:07,157 INFO L87 Difference]: Start difference. First operand 60154 states and 232834 transitions. Second operand 7 states. [2019-12-18 12:27:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:08,448 INFO L93 Difference]: Finished difference Result 155268 states and 600597 transitions. [2019-12-18 12:27:08,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:27:08,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 12:27:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:08,804 INFO L225 Difference]: With dead ends: 155268 [2019-12-18 12:27:08,805 INFO L226 Difference]: Without dead ends: 129034 [2019-12-18 12:27:08,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:27:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129034 states. [2019-12-18 12:27:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129034 to 99256. [2019-12-18 12:27:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99256 states. [2019-12-18 12:27:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99256 states to 99256 states and 387623 transitions. [2019-12-18 12:27:12,273 INFO L78 Accepts]: Start accepts. Automaton has 99256 states and 387623 transitions. Word has length 34 [2019-12-18 12:27:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:12,274 INFO L462 AbstractCegarLoop]: Abstraction has 99256 states and 387623 transitions. [2019-12-18 12:27:12,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:27:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 99256 states and 387623 transitions. [2019-12-18 12:27:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:27:12,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:12,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:12,427 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:12,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:12,428 INFO L82 PathProgramCache]: Analyzing trace with hash 310200044, now seen corresponding path program 2 times [2019-12-18 12:27:12,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:12,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842024286] [2019-12-18 12:27:12,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:12,588 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 12:27:12,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842024286] [2019-12-18 12:27:12,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:12,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:27:12,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212354944] [2019-12-18 12:27:12,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:27:12,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:12,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:27:12,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:27:12,590 INFO L87 Difference]: Start difference. First operand 99256 states and 387623 transitions. Second operand 9 states. [2019-12-18 12:27:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:15,627 INFO L93 Difference]: Finished difference Result 146366 states and 575886 transitions. [2019-12-18 12:27:15,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:27:15,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 12:27:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:16,009 INFO L225 Difference]: With dead ends: 146366 [2019-12-18 12:27:16,009 INFO L226 Difference]: Without dead ends: 136406 [2019-12-18 12:27:16,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:27:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136406 states. [2019-12-18 12:27:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136406 to 106272. [2019-12-18 12:27:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106272 states. [2019-12-18 12:27:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106272 states to 106272 states and 416309 transitions. [2019-12-18 12:27:26,160 INFO L78 Accepts]: Start accepts. Automaton has 106272 states and 416309 transitions. Word has length 34 [2019-12-18 12:27:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:26,161 INFO L462 AbstractCegarLoop]: Abstraction has 106272 states and 416309 transitions. [2019-12-18 12:27:26,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:27:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 106272 states and 416309 transitions. [2019-12-18 12:27:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:27:26,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:26,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:26,323 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1249269200, now seen corresponding path program 3 times [2019-12-18 12:27:26,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:26,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841206852] [2019-12-18 12:27:26,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:26,458 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 12:27:26,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841206852] [2019-12-18 12:27:26,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:26,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:27:26,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219261147] [2019-12-18 12:27:26,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:27:26,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:26,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:27:26,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:27:26,460 INFO L87 Difference]: Start difference. First operand 106272 states and 416309 transitions. Second operand 8 states. [2019-12-18 12:27:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:27,976 INFO L93 Difference]: Finished difference Result 182544 states and 716809 transitions. [2019-12-18 12:27:27,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:27:27,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 12:27:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:28,466 INFO L225 Difference]: With dead ends: 182544 [2019-12-18 12:27:28,466 INFO L226 Difference]: Without dead ends: 176872 [2019-12-18 12:27:28,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:27:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176872 states. [2019-12-18 12:27:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176872 to 99042. [2019-12-18 12:27:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99042 states. [2019-12-18 12:27:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99042 states to 99042 states and 386940 transitions. [2019-12-18 12:27:36,600 INFO L78 Accepts]: Start accepts. Automaton has 99042 states and 386940 transitions. Word has length 34 [2019-12-18 12:27:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:36,600 INFO L462 AbstractCegarLoop]: Abstraction has 99042 states and 386940 transitions. [2019-12-18 12:27:36,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:27:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 99042 states and 386940 transitions. [2019-12-18 12:27:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 12:27:36,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:36,730 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] [2019-12-18 12:27:36,730 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2100031247, now seen corresponding path program 1 times [2019-12-18 12:27:36,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:36,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147537986] [2019-12-18 12:27:36,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:36,814 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 12:27:36,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147537986] [2019-12-18 12:27:36,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:36,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:27:36,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241988188] [2019-12-18 12:27:36,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:27:36,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:36,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:27:36,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:27:36,819 INFO L87 Difference]: Start difference. First operand 99042 states and 386940 transitions. Second operand 4 states. [2019-12-18 12:27:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:37,135 INFO L93 Difference]: Finished difference Result 59055 states and 202005 transitions. [2019-12-18 12:27:37,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:27:37,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-18 12:27:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:37,248 INFO L225 Difference]: With dead ends: 59055 [2019-12-18 12:27:37,248 INFO L226 Difference]: Without dead ends: 53623 [2019-12-18 12:27:37,249 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 12:27:37,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53623 states. [2019-12-18 12:27:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53623 to 53623. [2019-12-18 12:27:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53623 states. [2019-12-18 12:27:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53623 states to 53623 states and 182866 transitions. [2019-12-18 12:27:38,947 INFO L78 Accepts]: Start accepts. Automaton has 53623 states and 182866 transitions. Word has length 35 [2019-12-18 12:27:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:38,947 INFO L462 AbstractCegarLoop]: Abstraction has 53623 states and 182866 transitions. [2019-12-18 12:27:38,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:27:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 53623 states and 182866 transitions. [2019-12-18 12:27:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 12:27:39,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:39,003 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] [2019-12-18 12:27:39,003 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:39,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:39,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1396410162, now seen corresponding path program 1 times [2019-12-18 12:27:39,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:39,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518797892] [2019-12-18 12:27:39,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:39,088 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 12:27:39,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518797892] [2019-12-18 12:27:39,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:39,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:27:39,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951703082] [2019-12-18 12:27:39,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:27:39,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:39,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:27:39,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:27:39,091 INFO L87 Difference]: Start difference. First operand 53623 states and 182866 transitions. Second operand 5 states. [2019-12-18 12:27:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:39,191 INFO L93 Difference]: Finished difference Result 9716 states and 29762 transitions. [2019-12-18 12:27:39,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:27:39,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-18 12:27:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:39,210 INFO L225 Difference]: With dead ends: 9716 [2019-12-18 12:27:39,210 INFO L226 Difference]: Without dead ends: 6887 [2019-12-18 12:27:39,211 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 12:27:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6887 states. [2019-12-18 12:27:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6887 to 6887. [2019-12-18 12:27:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6887 states. [2019-12-18 12:27:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6887 states to 6887 states and 19882 transitions. [2019-12-18 12:27:39,362 INFO L78 Accepts]: Start accepts. Automaton has 6887 states and 19882 transitions. Word has length 36 [2019-12-18 12:27:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:39,363 INFO L462 AbstractCegarLoop]: Abstraction has 6887 states and 19882 transitions. [2019-12-18 12:27:39,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:27:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6887 states and 19882 transitions. [2019-12-18 12:27:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:27:39,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:39,374 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 12:27:39,375 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:39,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1883380707, now seen corresponding path program 1 times [2019-12-18 12:27:39,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:39,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319456823] [2019-12-18 12:27:39,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:27:39,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319456823] [2019-12-18 12:27:39,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:39,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:27:39,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910354396] [2019-12-18 12:27:39,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:27:39,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:39,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:27:39,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:27:39,437 INFO L87 Difference]: Start difference. First operand 6887 states and 19882 transitions. Second operand 4 states. [2019-12-18 12:27:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:39,482 INFO L93 Difference]: Finished difference Result 7914 states and 22195 transitions. [2019-12-18 12:27:39,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:27:39,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 12:27:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:39,495 INFO L225 Difference]: With dead ends: 7914 [2019-12-18 12:27:39,495 INFO L226 Difference]: Without dead ends: 6898 [2019-12-18 12:27:39,495 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 12:27:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2019-12-18 12:27:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 6879. [2019-12-18 12:27:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6879 states. [2019-12-18 12:27:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6879 states to 6879 states and 19794 transitions. [2019-12-18 12:27:39,627 INFO L78 Accepts]: Start accepts. Automaton has 6879 states and 19794 transitions. Word has length 47 [2019-12-18 12:27:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:39,628 INFO L462 AbstractCegarLoop]: Abstraction has 6879 states and 19794 transitions. [2019-12-18 12:27:39,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:27:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 6879 states and 19794 transitions. [2019-12-18 12:27:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:27:39,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:39,639 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 12:27:39,639 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:39,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:39,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1612037247, now seen corresponding path program 2 times [2019-12-18 12:27:39,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:39,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185344730] [2019-12-18 12:27:39,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:39,721 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 12:27:39,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185344730] [2019-12-18 12:27:39,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:39,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:27:39,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305486139] [2019-12-18 12:27:39,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:39,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:39,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:39,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:39,723 INFO L87 Difference]: Start difference. First operand 6879 states and 19794 transitions. Second operand 3 states. [2019-12-18 12:27:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:39,765 INFO L93 Difference]: Finished difference Result 10651 states and 29044 transitions. [2019-12-18 12:27:39,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:39,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 12:27:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:39,777 INFO L225 Difference]: With dead ends: 10651 [2019-12-18 12:27:39,777 INFO L226 Difference]: Without dead ends: 6693 [2019-12-18 12:27:39,778 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 12:27:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6693 states. [2019-12-18 12:27:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6693 to 6668. [2019-12-18 12:27:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6668 states. [2019-12-18 12:27:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 16618 transitions. [2019-12-18 12:27:39,907 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 16618 transitions. Word has length 47 [2019-12-18 12:27:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:39,908 INFO L462 AbstractCegarLoop]: Abstraction has 6668 states and 16618 transitions. [2019-12-18 12:27:39,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 16618 transitions. [2019-12-18 12:27:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:27:39,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:39,920 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 12:27:39,920 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1124747, now seen corresponding path program 3 times [2019-12-18 12:27:39,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:39,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485289727] [2019-12-18 12:27:39,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:27:40,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485289727] [2019-12-18 12:27:40,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:40,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:27:40,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063881003] [2019-12-18 12:27:40,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:27:40,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:40,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:27:40,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:27:40,024 INFO L87 Difference]: Start difference. First operand 6668 states and 16618 transitions. Second operand 6 states. [2019-12-18 12:27:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:40,126 INFO L93 Difference]: Finished difference Result 5554 states and 14097 transitions. [2019-12-18 12:27:40,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:27:40,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 12:27:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:40,128 INFO L225 Difference]: With dead ends: 5554 [2019-12-18 12:27:40,128 INFO L226 Difference]: Without dead ends: 423 [2019-12-18 12:27:40,129 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 12:27:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-18 12:27:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2019-12-18 12:27:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-18 12:27:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 917 transitions. [2019-12-18 12:27:40,138 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 917 transitions. Word has length 47 [2019-12-18 12:27:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:40,139 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 917 transitions. [2019-12-18 12:27:40,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:27:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 917 transitions. [2019-12-18 12:27:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:27:40,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:40,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:40,140 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:40,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:40,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2126696180, now seen corresponding path program 1 times [2019-12-18 12:27:40,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:40,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304129419] [2019-12-18 12:27:40,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:40,255 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 12:27:40,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304129419] [2019-12-18 12:27:40,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:40,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:27:40,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803282859] [2019-12-18 12:27:40,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:27:40,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:27:40,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:27:40,258 INFO L87 Difference]: Start difference. First operand 423 states and 917 transitions. Second operand 8 states. [2019-12-18 12:27:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:40,509 INFO L93 Difference]: Finished difference Result 1174 states and 2536 transitions. [2019-12-18 12:27:40,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:27:40,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:27:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:40,511 INFO L225 Difference]: With dead ends: 1174 [2019-12-18 12:27:40,511 INFO L226 Difference]: Without dead ends: 939 [2019-12-18 12:27:40,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:27:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-12-18 12:27:40,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 506. [2019-12-18 12:27:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-12-18 12:27:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1098 transitions. [2019-12-18 12:27:40,523 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1098 transitions. Word has length 63 [2019-12-18 12:27:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:40,523 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 1098 transitions. [2019-12-18 12:27:40,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:27:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1098 transitions. [2019-12-18 12:27:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:27:40,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:40,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:40,525 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:40,525 INFO L82 PathProgramCache]: Analyzing trace with hash 222753420, now seen corresponding path program 2 times [2019-12-18 12:27:40,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:40,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712129329] [2019-12-18 12:27:40,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:27:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:27:40,642 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:27:40,650 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:27:40,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~z$flush_delayed~0_312) (= v_~z$r_buff0_thd1~0_133 0) (= |v_#NULL.offset_6| 0) (= 0 |v_ULTIMATE.start_main_~#t302~0.offset_23|) (= 0 v_~z$r_buff1_thd3~0_369) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~x~0_59 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t302~0.base_31| 4)) (= v_~z$read_delayed~0_6 0) (= v_~main$tmp_guard1~0_30 0) (= v_~z$w_buff0~0_407 0) (= v_~z$r_buff1_thd0~0_262 0) (= v_~z$r_buff1_thd1~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_53) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_246) (= v_~z$r_buff1_thd2~0_361 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t302~0.base_31|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_953 0) (= v_~z$r_buff0_thd0~0_190 0) (= v_~a~0_20 0) (= v_~weak$$choice2~0_312 0) (= 0 |v_#NULL.base_6|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t302~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t302~0.base_31|) |v_ULTIMATE.start_main_~#t302~0.offset_23| 0)) |v_#memory_int_23|) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~z$r_buff0_thd3~0_586) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$w_buff1~0_282 0) (= v_~z$w_buff1_used~0_540 0) (= v_~z$r_buff0_thd2~0_401 0) (= 0 v_~weak$$choice0~0_233) (= v_~main$tmp_guard0~0_32 0) (= v_~__unbuffered_cnt~0_150 0) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t302~0.base_31| 1)) (= v_~y~0_37 0) (= v_~z~0_322 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t302~0.base_31|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_361, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ULTIMATE.start_main_~#t304~0.base=|v_ULTIMATE.start_main_~#t304~0.base_22|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_246, ULTIMATE.start_main_~#t303~0.base=|v_ULTIMATE.start_main_~#t303~0.base_22|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_58|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_540, ~z$flush_delayed~0=v_~z$flush_delayed~0_312, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~weak$$choice0~0=v_~weak$$choice0~0_233, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_201, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_586, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150, ~x~0=v_~x~0_59, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t302~0.offset=|v_ULTIMATE.start_main_~#t302~0.offset_23|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_282, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t302~0.base=|v_ULTIMATE.start_main_~#t302~0.base_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_262, ~y~0=v_~y~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_401, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_953, ~z$w_buff0~0=v_~z$w_buff0~0_407, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_369, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_73|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_main_~#t304~0.offset=|v_ULTIMATE.start_main_~#t304~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_446|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t303~0.offset=|v_ULTIMATE.start_main_~#t303~0.offset_18|, ~z~0=v_~z~0_322, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t304~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t303~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t302~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t302~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t304~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t303~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:27:40,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t303~0.base_10|)) (= |v_ULTIMATE.start_main_~#t303~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t303~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t303~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t303~0.base_10|) |v_ULTIMATE.start_main_~#t303~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t303~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t303~0.base_10| 4)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t303~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t303~0.base=|v_ULTIMATE.start_main_~#t303~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t303~0.offset=|v_ULTIMATE.start_main_~#t303~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t303~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t303~0.offset, #length] because there is no mapped edge [2019-12-18 12:27:40,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L840-1-->L842: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t304~0.base_11| 4) |v_#length_17|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t304~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t304~0.base_11|) |v_ULTIMATE.start_main_~#t304~0.offset_10| 2))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t304~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t304~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t304~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t304~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t304~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t304~0.base=|v_ULTIMATE.start_main_~#t304~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t304~0.offset=|v_ULTIMATE.start_main_~#t304~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t304~0.base, #length, ULTIMATE.start_main_~#t304~0.offset] because there is no mapped edge [2019-12-18 12:27:40,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= (mod v_~z$w_buff1_used~0_82 256) 0) (= v_~z$w_buff0~0_55 v_~z$w_buff1~0_45) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_82) (= 1 v_~z$w_buff0~0_54) (= v_~z$w_buff0_used~0_157 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_19) (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_19) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_21 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_54, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_45, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 12:27:40,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1170594396 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1170594396 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out1170594396| |P2Thread1of1ForFork0_#t~ite29_Out1170594396|))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out1170594396| ~z$w_buff1~0_In1170594396)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out1170594396| ~z$w_buff0~0_In1170594396) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1170594396, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1170594396, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1170594396, ~z$w_buff1~0=~z$w_buff1~0_In1170594396} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1170594396|, ~z$w_buff0~0=~z$w_buff0~0_In1170594396, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1170594396, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1170594396, ~z$w_buff1~0=~z$w_buff1~0_In1170594396, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1170594396|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:27:40,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_95 v_~z$r_buff0_thd3~0_94) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_11|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_8|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:27:40,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1183995163 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out1183995163| ~z$mem_tmp~0_In1183995163) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out1183995163| ~z~0_In1183995163) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1183995163, ~z$flush_delayed~0=~z$flush_delayed~0_In1183995163, ~z~0=~z~0_In1183995163} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1183995163|, ~z$mem_tmp~0=~z$mem_tmp~0_In1183995163, ~z$flush_delayed~0=~z$flush_delayed~0_In1183995163, ~z~0=~z~0_In1183995163} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 12:27:40,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_36 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.base_9 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_9|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{~a~0=v_~a~0_13, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:27:40,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In166206873 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In166206873 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out166206873|)) (and (= ~z$w_buff0_used~0_In166206873 |P2Thread1of1ForFork0_#t~ite51_Out166206873|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In166206873, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In166206873} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In166206873, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In166206873, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out166206873|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 12:27:40,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1043838439 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1043838439 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1043838439 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1043838439 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-1043838439|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite52_Out-1043838439| ~z$w_buff1_used~0_In-1043838439)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1043838439, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1043838439, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1043838439, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1043838439} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1043838439, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1043838439, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1043838439, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1043838439|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1043838439} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 12:27:40,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In650517990 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In650517990 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out650517990) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In650517990 ~z$r_buff0_thd3~0_Out650517990) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In650517990, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In650517990} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In650517990, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out650517990, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out650517990|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 12:27:40,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1993678710 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1993678710 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1993678710 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1993678710 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1993678710 |P2Thread1of1ForFork0_#t~ite54_Out1993678710|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1993678710|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1993678710, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1993678710, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1993678710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1993678710} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1993678710, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1993678710|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1993678710, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1993678710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1993678710} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 12:27:40,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= v_~z$r_buff1_thd3~0_301 |v_P2Thread1of1ForFork0_#t~ite54_32|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:27:40,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-2046095993 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-2046095993| ~z$mem_tmp~0_In-2046095993) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-2046095993| ~z~0_In-2046095993)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2046095993, ~z$flush_delayed~0=~z$flush_delayed~0_In-2046095993, ~z~0=~z~0_In-2046095993} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2046095993, ~z$flush_delayed~0=~z$flush_delayed~0_In-2046095993, ~z~0=~z~0_In-2046095993, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-2046095993|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 12:27:40,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L771-2-->P1EXIT: Formula: (and (= v_~z~0_145 |v_P1Thread1of1ForFork2_#t~ite25_58|) (= 0 v_~z$flush_delayed~0_126) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_58|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_126, ~z~0=v_~z~0_145, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_57|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 12:27:40,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= 0 (mod v_~z$w_buff0_used~0_136 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:27:40,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1522041985 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out1522041985| |ULTIMATE.start_main_#t~ite58_Out1522041985|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1522041985 256)))) (or (and (= ~z~0_In1522041985 |ULTIMATE.start_main_#t~ite58_Out1522041985|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~z$w_buff1~0_In1522041985 |ULTIMATE.start_main_#t~ite58_Out1522041985|) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1522041985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1522041985, ~z$w_buff1~0=~z$w_buff1~0_In1522041985, ~z~0=~z~0_In1522041985} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1522041985, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1522041985|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1522041985, ~z$w_buff1~0=~z$w_buff1~0_In1522041985, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1522041985|, ~z~0=~z~0_In1522041985} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 12:27:40,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1916879452 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1916879452 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1916879452|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1916879452 |ULTIMATE.start_main_#t~ite60_Out-1916879452|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1916879452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1916879452} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1916879452|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1916879452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1916879452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 12:27:40,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-1301900816 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1301900816 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1301900816 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1301900816 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out-1301900816|)) (and (= ~z$w_buff1_used~0_In-1301900816 |ULTIMATE.start_main_#t~ite61_Out-1301900816|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1301900816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1301900816, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1301900816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1301900816} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1301900816, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1301900816|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1301900816, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1301900816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1301900816} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 12:27:40,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2047473620 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2047473620 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-2047473620|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-2047473620 |ULTIMATE.start_main_#t~ite62_Out-2047473620|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2047473620, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2047473620} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2047473620|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2047473620, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2047473620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 12:27:40,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1749578732 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1749578732 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1749578732 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1749578732 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1749578732| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out-1749578732| ~z$r_buff1_thd0~0_In-1749578732)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1749578732, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1749578732, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1749578732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1749578732} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1749578732|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1749578732, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1749578732, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1749578732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1749578732} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 12:27:40,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~x~0_50 2) (= v_~__unbuffered_p1_EBX~0_20 0) (= v_~main$tmp_guard1~0_21 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_~z$r_buff1_thd0~0_249 |v_ULTIMATE.start_main_#t~ite63_36|) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 1 v_~__unbuffered_p1_EAX~0_44) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, 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 12:27:40,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:27:40 BasicIcfg [2019-12-18 12:27:40,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:27:40,864 INFO L168 Benchmark]: Toolchain (without parser) took 80613.17 ms. Allocated memory was 137.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 12:27:40,865 INFO L168 Benchmark]: CDTParser took 1.60 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:27:40,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.92 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 155.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:40,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.22 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 151.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:40,871 INFO L168 Benchmark]: Boogie Preprocessor took 39.94 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:40,871 INFO L168 Benchmark]: RCFGBuilder took 1088.66 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 93.7 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:40,875 INFO L168 Benchmark]: TraceAbstraction took 78580.79 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 93.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 12:27:40,881 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.60 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.92 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 155.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.22 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 151.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.94 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1088.66 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 93.7 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78580.79 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 93.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.6s, 196 ProgramPointsBefore, 103 ProgramPointsAfterwards, 242 TransitionsBefore, 122 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 31 ChoiceCompositions, 9041 VarBasedMoverChecksPositive, 312 VarBasedMoverChecksNegative, 82 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 115591 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t302, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L840] FCALL, FORK 0 pthread_create(&t303, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L842] FCALL, FORK 0 pthread_create(&t304, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L789] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = (_Bool)1 [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 z$flush_delayed = weak$$choice2 [L799] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 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) [L801] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L801] 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)) [L802] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L802] 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)) [L803] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L803] 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)) [L804] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L804] 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)) [L806] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L806] 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)) [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L808] 3 z = z$flush_delayed ? z$mem_tmp : z [L809] 3 z$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L750] 2 x = 2 [L753] 2 y = 1 [L756] 2 __unbuffered_p1_EAX = y [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 z$flush_delayed = weak$$choice2 [L762] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L763] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L763] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L764] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L764] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L765] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L765] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L766] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L769] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L769] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 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 [L851] 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 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 78.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3520 SDtfs, 5040 SDslu, 7617 SDs, 0 SdLazy, 2956 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106272occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 162475 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 55795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...