/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:22:27,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:22:27,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:22:27,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:22:27,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:22:27,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:22:27,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:22:27,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:22:27,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:22:27,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:22:27,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:22:27,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:22:27,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:22:27,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:22:27,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:22:27,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:22:27,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:22:27,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:22:27,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:22:27,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:22:27,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:22:27,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:22:27,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:22:27,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:22:27,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:22:27,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:22:27,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:22:27,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:22:27,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:22:27,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:22:27,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:22:27,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:22:27,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:22:27,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:22:27,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:22:27,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:22:27,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:22:27,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:22:27,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:22:27,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:22:27,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:22:27,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:22:27,252 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:22:27,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:22:27,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:22:27,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:22:27,254 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:22:27,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:22:27,254 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:22:27,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:22:27,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:22:27,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:22:27,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:22:27,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:22:27,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:22:27,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:22:27,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:22:27,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:22:27,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:22:27,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:22:27,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:22:27,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:22:27,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:22:27,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:22:27,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:22:27,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:22:27,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:22:27,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:22:27,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:22:27,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:22:27,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:22:27,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:22:27,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:22:27,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:22:27,557 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:22:27,558 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:22:27,559 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i [2019-12-18 17:22:27,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d53f84c/d81039ffad2a4f648add26a6a5c2260f/FLAGede787da2 [2019-12-18 17:22:28,249 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:22:28,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i [2019-12-18 17:22:28,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d53f84c/d81039ffad2a4f648add26a6a5c2260f/FLAGede787da2 [2019-12-18 17:22:28,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d53f84c/d81039ffad2a4f648add26a6a5c2260f [2019-12-18 17:22:28,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:22:28,508 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:22:28,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:22:28,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:22:28,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:22:28,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:22:28" (1/1) ... [2019-12-18 17:22:28,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c2c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:28, skipping insertion in model container [2019-12-18 17:22:28,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:22:28" (1/1) ... [2019-12-18 17:22:28,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:22:28,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:22:29,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:22:29,047 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:22:29,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:22:29,189 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:22:29,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29 WrapperNode [2019-12-18 17:22:29,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:22:29,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:22:29,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:22:29,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:22:29,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (1/1) ... [2019-12-18 17:22:29,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (1/1) ... [2019-12-18 17:22:29,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:22:29,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:22:29,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:22:29,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:22:29,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (1/1) ... [2019-12-18 17:22:29,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (1/1) ... [2019-12-18 17:22:29,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (1/1) ... [2019-12-18 17:22:29,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (1/1) ... [2019-12-18 17:22:29,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (1/1) ... [2019-12-18 17:22:29,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (1/1) ... [2019-12-18 17:22:29,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (1/1) ... [2019-12-18 17:22:29,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:22:29,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:22:29,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:22:29,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:22:29,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (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 17:22:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:22:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:22:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:22:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:22:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:22:29,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:22:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:22:29,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:22:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:22:29,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:22:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:22:29,370 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:22:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:22:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:22:29,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:22:29,373 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 17:22:30,132 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:22:30,132 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:22:30,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:22:30 BoogieIcfgContainer [2019-12-18 17:22:30,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:22:30,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:22:30,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:22:30,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:22:30,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:22:28" (1/3) ... [2019-12-18 17:22:30,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572c8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:22:30, skipping insertion in model container [2019-12-18 17:22:30,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:22:29" (2/3) ... [2019-12-18 17:22:30,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572c8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:22:30, skipping insertion in model container [2019-12-18 17:22:30,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:22:30" (3/3) ... [2019-12-18 17:22:30,143 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_tso.opt.i [2019-12-18 17:22:30,153 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:22:30,153 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:22:30,162 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:22:30,163 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:22:30,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,203 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,204 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,205 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,207 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,208 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,232 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,232 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,232 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,232 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,233 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,233 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,233 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,233 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,234 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,234 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,234 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,234 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,235 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,235 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,235 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,236 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,236 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,236 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,236 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,236 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,237 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,237 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,237 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,237 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,238 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,238 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,238 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,238 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,239 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,239 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,239 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,239 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,240 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,240 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,244 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,244 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,251 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,252 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,258 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,259 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,259 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,259 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,259 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,260 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,260 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,260 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,260 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,261 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,261 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,261 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:22:30,306 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:22:30,326 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:22:30,326 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:22:30,327 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:22:30,327 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:22:30,327 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:22:30,327 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:22:30,327 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:22:30,327 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:22:30,345 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-18 17:22:30,347 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 17:22:30,469 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 17:22:30,470 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:22:30,489 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 17:22:30,510 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 17:22:30,563 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 17:22:30,563 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:22:30,569 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 17:22:30,585 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 17:22:30,587 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:22:35,136 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-18 17:22:35,508 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:22:35,624 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:22:36,098 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 17:22:36,250 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 17:22:36,284 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-18 17:22:36,284 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 17:22:36,288 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-18 17:22:37,483 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-18 17:22:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-18 17:22:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:22:37,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:37,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:37,494 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-18 17:22:37,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:37,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531323022] [2019-12-18 17:22:37,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:37,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 17:22:37,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531323022] [2019-12-18 17:22:37,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:37,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:22:37,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265289572] [2019-12-18 17:22:37,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:22:37,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:22:37,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:22:37,848 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-18 17:22:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:38,381 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-18 17:22:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:22:38,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:22:38,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:38,614 INFO L225 Difference]: With dead ends: 20958 [2019-12-18 17:22:38,615 INFO L226 Difference]: Without dead ends: 19662 [2019-12-18 17:22:38,616 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 17:22:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-18 17:22:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-18 17:22:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-18 17:22:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-18 17:22:40,618 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-18 17:22:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:40,619 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-18 17:22:40,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:22:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-18 17:22:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:22:40,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:40,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:40,627 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-18 17:22:40,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:40,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037454425] [2019-12-18 17:22:40,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:40,775 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 17:22:40,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037454425] [2019-12-18 17:22:40,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:40,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:22:40,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233099531] [2019-12-18 17:22:40,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:22:40,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:40,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:22:40,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:22:40,782 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-18 17:22:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:41,477 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-18 17:22:41,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:22:41,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:22:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:41,639 INFO L225 Difference]: With dead ends: 30494 [2019-12-18 17:22:41,639 INFO L226 Difference]: Without dead ends: 30438 [2019-12-18 17:22:41,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 17:22:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-18 17:22:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-18 17:22:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-18 17:22:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-18 17:22:43,934 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-18 17:22:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:43,934 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-18 17:22:43,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:22:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-18 17:22:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 17:22:43,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:43,941 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 17:22:43,942 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-18 17:22:43,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:43,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495272206] [2019-12-18 17:22:43,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:44,015 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 17:22:44,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495272206] [2019-12-18 17:22:44,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:44,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:22:44,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145176295] [2019-12-18 17:22:44,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:22:44,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:44,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:22:44,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:22:44,020 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-18 17:22:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:44,592 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-18 17:22:44,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:22:44,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 17:22:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:44,756 INFO L225 Difference]: With dead ends: 35230 [2019-12-18 17:22:44,756 INFO L226 Difference]: Without dead ends: 35182 [2019-12-18 17:22:44,757 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 17:22:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-18 17:22:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-18 17:22:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-18 17:22:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-18 17:22:46,429 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-18 17:22:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:46,430 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-18 17:22:46,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:22:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-18 17:22:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 17:22:46,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:46,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:46,444 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:46,445 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-18 17:22:46,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:46,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282912008] [2019-12-18 17:22:46,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:46,547 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 17:22:46,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282912008] [2019-12-18 17:22:46,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:46,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:22:46,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55273634] [2019-12-18 17:22:46,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:22:46,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:46,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:22:46,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:22:46,550 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-18 17:22:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:46,727 INFO L93 Difference]: Finished difference Result 30328 states and 126949 transitions. [2019-12-18 17:22:46,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:22:46,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 17:22:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:46,850 INFO L225 Difference]: With dead ends: 30328 [2019-12-18 17:22:46,851 INFO L226 Difference]: Without dead ends: 30328 [2019-12-18 17:22:46,851 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 17:22:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-12-18 17:22:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 30328. [2019-12-18 17:22:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30328 states. [2019-12-18 17:22:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30328 states to 30328 states and 126949 transitions. [2019-12-18 17:22:49,173 INFO L78 Accepts]: Start accepts. Automaton has 30328 states and 126949 transitions. Word has length 20 [2019-12-18 17:22:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:49,174 INFO L462 AbstractCegarLoop]: Abstraction has 30328 states and 126949 transitions. [2019-12-18 17:22:49,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:22:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 30328 states and 126949 transitions. [2019-12-18 17:22:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:22:49,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:49,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:49,190 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:49,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:49,190 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-18 17:22:49,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:49,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802780041] [2019-12-18 17:22:49,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:49,488 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 17:22:49,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802780041] [2019-12-18 17:22:49,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:49,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:22:49,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699280969] [2019-12-18 17:22:49,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:22:49,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:49,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:22:49,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:22:49,491 INFO L87 Difference]: Start difference. First operand 30328 states and 126949 transitions. Second operand 3 states. [2019-12-18 17:22:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:49,713 INFO L93 Difference]: Finished difference Result 44924 states and 179717 transitions. [2019-12-18 17:22:49,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:22:49,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 17:22:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:49,791 INFO L225 Difference]: With dead ends: 44924 [2019-12-18 17:22:49,791 INFO L226 Difference]: Without dead ends: 32296 [2019-12-18 17:22:49,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:22:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32296 states. [2019-12-18 17:22:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32296 to 31012. [2019-12-18 17:22:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31012 states. [2019-12-18 17:22:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31012 states to 31012 states and 116299 transitions. [2019-12-18 17:22:51,018 INFO L78 Accepts]: Start accepts. Automaton has 31012 states and 116299 transitions. Word has length 21 [2019-12-18 17:22:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:51,018 INFO L462 AbstractCegarLoop]: Abstraction has 31012 states and 116299 transitions. [2019-12-18 17:22:51,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:22:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 31012 states and 116299 transitions. [2019-12-18 17:22:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:22:51,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:51,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:51,028 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:51,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1131875471, now seen corresponding path program 1 times [2019-12-18 17:22:51,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:51,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686621791] [2019-12-18 17:22:51,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:51,076 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 17:22:51,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686621791] [2019-12-18 17:22:51,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:51,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:22:51,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481435873] [2019-12-18 17:22:51,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:22:51,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:51,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:22:51,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:22:51,080 INFO L87 Difference]: Start difference. First operand 31012 states and 116299 transitions. Second operand 3 states. [2019-12-18 17:22:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:51,204 INFO L93 Difference]: Finished difference Result 30604 states and 114575 transitions. [2019-12-18 17:22:51,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:22:51,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 17:22:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:51,270 INFO L225 Difference]: With dead ends: 30604 [2019-12-18 17:22:51,270 INFO L226 Difference]: Without dead ends: 30604 [2019-12-18 17:22:51,271 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 17:22:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30604 states. [2019-12-18 17:22:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30604 to 30436. [2019-12-18 17:22:53,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30436 states. [2019-12-18 17:22:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30436 states to 30436 states and 114095 transitions. [2019-12-18 17:22:53,777 INFO L78 Accepts]: Start accepts. Automaton has 30436 states and 114095 transitions. Word has length 21 [2019-12-18 17:22:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:53,777 INFO L462 AbstractCegarLoop]: Abstraction has 30436 states and 114095 transitions. [2019-12-18 17:22:53,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:22:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30436 states and 114095 transitions. [2019-12-18 17:22:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:22:53,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:53,792 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 17:22:53,792 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:53,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1107033684, now seen corresponding path program 1 times [2019-12-18 17:22:53,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:53,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065500943] [2019-12-18 17:22:53,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:53,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 17:22:53,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065500943] [2019-12-18 17:22:53,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:53,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:22:53,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832883597] [2019-12-18 17:22:53,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:22:53,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:53,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:22:53,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:22:53,864 INFO L87 Difference]: Start difference. First operand 30436 states and 114095 transitions. Second operand 4 states. [2019-12-18 17:22:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:54,007 INFO L93 Difference]: Finished difference Result 26240 states and 92121 transitions. [2019-12-18 17:22:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:22:54,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-18 17:22:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:54,054 INFO L225 Difference]: With dead ends: 26240 [2019-12-18 17:22:54,054 INFO L226 Difference]: Without dead ends: 24250 [2019-12-18 17:22:54,055 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 17:22:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24250 states. [2019-12-18 17:22:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24250 to 24250. [2019-12-18 17:22:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24250 states. [2019-12-18 17:22:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24250 states to 24250 states and 86221 transitions. [2019-12-18 17:22:54,569 INFO L78 Accepts]: Start accepts. Automaton has 24250 states and 86221 transitions. Word has length 22 [2019-12-18 17:22:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:54,570 INFO L462 AbstractCegarLoop]: Abstraction has 24250 states and 86221 transitions. [2019-12-18 17:22:54,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:22:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 24250 states and 86221 transitions. [2019-12-18 17:22:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 17:22:54,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:54,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:54,579 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash 477352398, now seen corresponding path program 1 times [2019-12-18 17:22:54,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:54,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885432772] [2019-12-18 17:22:54,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:54,627 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 17:22:54,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885432772] [2019-12-18 17:22:54,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:54,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:22:54,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721414554] [2019-12-18 17:22:54,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:22:54,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:54,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:22:54,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:22:54,630 INFO L87 Difference]: Start difference. First operand 24250 states and 86221 transitions. Second operand 4 states. [2019-12-18 17:22:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:54,791 INFO L93 Difference]: Finished difference Result 34611 states and 119806 transitions. [2019-12-18 17:22:54,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:22:54,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 17:22:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:55,120 INFO L225 Difference]: With dead ends: 34611 [2019-12-18 17:22:55,120 INFO L226 Difference]: Without dead ends: 21527 [2019-12-18 17:22:55,121 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 17:22:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21527 states. [2019-12-18 17:22:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21527 to 21244. [2019-12-18 17:22:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21244 states. [2019-12-18 17:22:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21244 states to 21244 states and 75726 transitions. [2019-12-18 17:22:55,483 INFO L78 Accepts]: Start accepts. Automaton has 21244 states and 75726 transitions. Word has length 23 [2019-12-18 17:22:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:55,484 INFO L462 AbstractCegarLoop]: Abstraction has 21244 states and 75726 transitions. [2019-12-18 17:22:55,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:22:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21244 states and 75726 transitions. [2019-12-18 17:22:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 17:22:55,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:55,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:55,492 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:55,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1501725894, now seen corresponding path program 1 times [2019-12-18 17:22:55,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:55,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299785251] [2019-12-18 17:22:55,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:55,543 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 17:22:55,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299785251] [2019-12-18 17:22:55,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:55,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:22:55,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052971750] [2019-12-18 17:22:55,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:22:55,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:55,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:22:55,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:22:55,546 INFO L87 Difference]: Start difference. First operand 21244 states and 75726 transitions. Second operand 3 states. [2019-12-18 17:22:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:55,673 INFO L93 Difference]: Finished difference Result 21244 states and 74724 transitions. [2019-12-18 17:22:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:22:55,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-18 17:22:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:55,728 INFO L225 Difference]: With dead ends: 21244 [2019-12-18 17:22:55,728 INFO L226 Difference]: Without dead ends: 21244 [2019-12-18 17:22:55,728 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 17:22:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21244 states. [2019-12-18 17:22:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21244 to 20871. [2019-12-18 17:22:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20871 states. [2019-12-18 17:22:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20871 states to 20871 states and 73508 transitions. [2019-12-18 17:22:56,426 INFO L78 Accepts]: Start accepts. Automaton has 20871 states and 73508 transitions. Word has length 23 [2019-12-18 17:22:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:56,427 INFO L462 AbstractCegarLoop]: Abstraction has 20871 states and 73508 transitions. [2019-12-18 17:22:56,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:22:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 20871 states and 73508 transitions. [2019-12-18 17:22:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 17:22:56,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:56,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:56,435 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:56,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:56,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1161161883, now seen corresponding path program 1 times [2019-12-18 17:22:56,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:56,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114631781] [2019-12-18 17:22:56,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:56,524 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 17:22:56,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114631781] [2019-12-18 17:22:56,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:56,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:22:56,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964425455] [2019-12-18 17:22:56,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:22:56,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:56,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:22:56,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:22:56,527 INFO L87 Difference]: Start difference. First operand 20871 states and 73508 transitions. Second operand 5 states. [2019-12-18 17:22:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:56,634 INFO L93 Difference]: Finished difference Result 9585 states and 29775 transitions. [2019-12-18 17:22:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:22:56,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 17:22:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:56,654 INFO L225 Difference]: With dead ends: 9585 [2019-12-18 17:22:56,655 INFO L226 Difference]: Without dead ends: 8268 [2019-12-18 17:22:56,655 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 17:22:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2019-12-18 17:22:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 8268. [2019-12-18 17:22:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8268 states. [2019-12-18 17:22:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 25567 transitions. [2019-12-18 17:22:56,858 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 25567 transitions. Word has length 24 [2019-12-18 17:22:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:56,858 INFO L462 AbstractCegarLoop]: Abstraction has 8268 states and 25567 transitions. [2019-12-18 17:22:56,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:22:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 25567 transitions. [2019-12-18 17:22:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:22:56,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:56,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:56,864 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1743073835, now seen corresponding path program 1 times [2019-12-18 17:22:56,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:56,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17605273] [2019-12-18 17:22:56,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:56,926 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 17:22:56,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17605273] [2019-12-18 17:22:56,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:56,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:22:56,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304482187] [2019-12-18 17:22:56,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:22:56,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:56,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:22:56,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:22:56,929 INFO L87 Difference]: Start difference. First operand 8268 states and 25567 transitions. Second operand 4 states. [2019-12-18 17:22:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:56,998 INFO L93 Difference]: Finished difference Result 12230 states and 37956 transitions. [2019-12-18 17:22:56,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:22:56,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:22:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:57,014 INFO L225 Difference]: With dead ends: 12230 [2019-12-18 17:22:57,015 INFO L226 Difference]: Without dead ends: 7682 [2019-12-18 17:22:57,015 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 17:22:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2019-12-18 17:22:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 7209. [2019-12-18 17:22:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-12-18 17:22:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 21269 transitions. [2019-12-18 17:22:57,164 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 21269 transitions. Word has length 25 [2019-12-18 17:22:57,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:57,164 INFO L462 AbstractCegarLoop]: Abstraction has 7209 states and 21269 transitions. [2019-12-18 17:22:57,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:22:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 21269 transitions. [2019-12-18 17:22:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:22:57,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:57,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:57,168 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:57,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:57,169 INFO L82 PathProgramCache]: Analyzing trace with hash -82285579, now seen corresponding path program 2 times [2019-12-18 17:22:57,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:57,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015062890] [2019-12-18 17:22:57,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:57,249 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 17:22:57,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015062890] [2019-12-18 17:22:57,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:57,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:22:57,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917668468] [2019-12-18 17:22:57,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:22:57,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:57,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:22:57,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:22:57,251 INFO L87 Difference]: Start difference. First operand 7209 states and 21269 transitions. Second operand 6 states. [2019-12-18 17:22:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:57,371 INFO L93 Difference]: Finished difference Result 2913 states and 7585 transitions. [2019-12-18 17:22:57,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:22:57,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 17:22:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:57,375 INFO L225 Difference]: With dead ends: 2913 [2019-12-18 17:22:57,376 INFO L226 Difference]: Without dead ends: 2472 [2019-12-18 17:22:57,376 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 17:22:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-12-18 17:22:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-12-18 17:22:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-12-18 17:22:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 6301 transitions. [2019-12-18 17:22:57,413 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 6301 transitions. Word has length 25 [2019-12-18 17:22:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:57,413 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 6301 transitions. [2019-12-18 17:22:57,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:22:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 6301 transitions. [2019-12-18 17:22:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:22:57,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:57,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:57,419 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:57,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:57,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-18 17:22:57,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:57,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381463641] [2019-12-18 17:22:57,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:57,472 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 17:22:57,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381463641] [2019-12-18 17:22:57,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:57,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:22:57,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008842022] [2019-12-18 17:22:57,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:22:57,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:57,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:22:57,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:22:57,474 INFO L87 Difference]: Start difference. First operand 2472 states and 6301 transitions. Second operand 3 states. [2019-12-18 17:22:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:57,530 INFO L93 Difference]: Finished difference Result 3752 states and 9516 transitions. [2019-12-18 17:22:57,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:22:57,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 17:22:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:57,536 INFO L225 Difference]: With dead ends: 3752 [2019-12-18 17:22:57,536 INFO L226 Difference]: Without dead ends: 3752 [2019-12-18 17:22:57,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:22:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-18 17:22:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2928. [2019-12-18 17:22:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-12-18 17:22:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 7542 transitions. [2019-12-18 17:22:57,586 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 7542 transitions. Word has length 32 [2019-12-18 17:22:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:57,586 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 7542 transitions. [2019-12-18 17:22:57,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:22:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 7542 transitions. [2019-12-18 17:22:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:22:57,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:57,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:57,592 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-18 17:22:57,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:57,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470701556] [2019-12-18 17:22:57,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:57,690 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 17:22:57,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470701556] [2019-12-18 17:22:57,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:57,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:22:57,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800508281] [2019-12-18 17:22:57,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:22:57,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:57,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:22:57,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:22:57,692 INFO L87 Difference]: Start difference. First operand 2928 states and 7542 transitions. Second operand 6 states. [2019-12-18 17:22:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:58,129 INFO L93 Difference]: Finished difference Result 5425 states and 13386 transitions. [2019-12-18 17:22:58,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:22:58,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 17:22:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:58,138 INFO L225 Difference]: With dead ends: 5425 [2019-12-18 17:22:58,138 INFO L226 Difference]: Without dead ends: 5242 [2019-12-18 17:22:58,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:22:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2019-12-18 17:22:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2952. [2019-12-18 17:22:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-18 17:22:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 7548 transitions. [2019-12-18 17:22:58,196 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 7548 transitions. Word has length 32 [2019-12-18 17:22:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:58,197 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 7548 transitions. [2019-12-18 17:22:58,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:22:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 7548 transitions. [2019-12-18 17:22:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:22:58,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:58,202 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 17:22:58,202 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:58,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:58,202 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-18 17:22:58,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:58,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609156636] [2019-12-18 17:22:58,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:58,281 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 17:22:58,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609156636] [2019-12-18 17:22:58,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:58,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:22:58,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493091210] [2019-12-18 17:22:58,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:22:58,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:58,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:22:58,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:22:58,283 INFO L87 Difference]: Start difference. First operand 2952 states and 7548 transitions. Second operand 6 states. [2019-12-18 17:22:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:58,724 INFO L93 Difference]: Finished difference Result 5331 states and 12930 transitions. [2019-12-18 17:22:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:22:58,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 17:22:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:58,732 INFO L225 Difference]: With dead ends: 5331 [2019-12-18 17:22:58,732 INFO L226 Difference]: Without dead ends: 5133 [2019-12-18 17:22:58,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:22:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2019-12-18 17:22:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 2837. [2019-12-18 17:22:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2019-12-18 17:22:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 7139 transitions. [2019-12-18 17:22:58,772 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 7139 transitions. Word has length 33 [2019-12-18 17:22:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:58,772 INFO L462 AbstractCegarLoop]: Abstraction has 2837 states and 7139 transitions. [2019-12-18 17:22:58,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:22:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 7139 transitions. [2019-12-18 17:22:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:22:58,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:58,775 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 17:22:58,776 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:58,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:58,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1104473775, now seen corresponding path program 1 times [2019-12-18 17:22:58,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:58,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765977394] [2019-12-18 17:22:58,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:58,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 17:22:58,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765977394] [2019-12-18 17:22:58,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:58,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:22:58,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356969352] [2019-12-18 17:22:58,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:22:58,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:22:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:22:58,865 INFO L87 Difference]: Start difference. First operand 2837 states and 7139 transitions. Second operand 7 states. [2019-12-18 17:22:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:58,983 INFO L93 Difference]: Finished difference Result 2153 states and 5477 transitions. [2019-12-18 17:22:58,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:22:58,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 17:22:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:58,985 INFO L225 Difference]: With dead ends: 2153 [2019-12-18 17:22:58,985 INFO L226 Difference]: Without dead ends: 476 [2019-12-18 17:22:58,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:22:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-18 17:22:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 470. [2019-12-18 17:22:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-12-18 17:22:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1059 transitions. [2019-12-18 17:22:58,990 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1059 transitions. Word has length 34 [2019-12-18 17:22:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:58,990 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 1059 transitions. [2019-12-18 17:22:58,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:22:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1059 transitions. [2019-12-18 17:22:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:22:58,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:58,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:58,992 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 1 times [2019-12-18 17:22:58,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:58,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665575535] [2019-12-18 17:22:58,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:22:59,067 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 17:22:59,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665575535] [2019-12-18 17:22:59,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:22:59,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:22:59,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350264411] [2019-12-18 17:22:59,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:22:59,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:22:59,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:22:59,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:22:59,070 INFO L87 Difference]: Start difference. First operand 470 states and 1059 transitions. Second operand 7 states. [2019-12-18 17:22:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:22:59,219 INFO L93 Difference]: Finished difference Result 892 states and 1966 transitions. [2019-12-18 17:22:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:22:59,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 17:22:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:22:59,221 INFO L225 Difference]: With dead ends: 892 [2019-12-18 17:22:59,221 INFO L226 Difference]: Without dead ends: 594 [2019-12-18 17:22:59,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:22:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-18 17:22:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-18 17:22:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-18 17:22:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-18 17:22:59,228 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-18 17:22:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:22:59,228 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-18 17:22:59,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:22:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-18 17:22:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:22:59,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:22:59,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:22:59,230 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:22:59,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:22:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 2 times [2019-12-18 17:22:59,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:22:59,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685062842] [2019-12-18 17:22:59,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:22:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:22:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:22:59,372 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:22:59,372 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:22:59,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1053~0.base_71| 4)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_71|)) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 |v_ULTIMATE.start_main_~#t1053~0.offset_43|) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1053~0.base_71|) (= v_~z$read_delayed~0_7 0) (= |v_#NULL.offset_5| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_71| 1) |v_#valid_117|) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1053~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1053~0.base_71|) |v_ULTIMATE.start_main_~#t1053~0.offset_43| 0)) |v_#memory_int_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1053~0.offset=|v_ULTIMATE.start_main_~#t1053~0.offset_43|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t1053~0.base=|v_ULTIMATE.start_main_~#t1053~0.base_71|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_24|, ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_25|, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_36|, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_36|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_68|, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1053~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1053~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1055~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1056~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1054~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1055~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1054~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:22:59,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1054~0.base_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1054~0.base_11| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1054~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1054~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11|) |v_ULTIMATE.start_main_~#t1054~0.offset_10| 1)) |v_#memory_int_19|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1054~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1054~0.base] because there is no mapped edge [2019-12-18 17:22:59,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1055~0.base_12|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12|) |v_ULTIMATE.start_main_~#t1055~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t1055~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1055~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1055~0.base_12| 0)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1055~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1055~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 17:22:59,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1056~0.offset_10|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1056~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1056~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12|) |v_ULTIMATE.start_main_~#t1056~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1056~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_10|, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1056~0.base] because there is no mapped edge [2019-12-18 17:22:59,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff1_thd2~0_Out1171515774 ~z$r_buff0_thd2~0_In1171515774) (= ~z$r_buff0_thd4~0_Out1171515774 1) (= ~__unbuffered_p3_EBX~0_Out1171515774 ~b~0_In1171515774) (= ~z$r_buff0_thd1~0_In1171515774 ~z$r_buff1_thd1~0_Out1171515774) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1171515774)) (= ~z$r_buff1_thd0~0_Out1171515774 ~z$r_buff0_thd0~0_In1171515774) (= ~z$r_buff1_thd3~0_Out1171515774 ~z$r_buff0_thd3~0_In1171515774) (= ~z$r_buff0_thd4~0_In1171515774 ~z$r_buff1_thd4~0_Out1171515774) (= ~a~0_Out1171515774 1) (= ~a~0_Out1171515774 ~__unbuffered_p3_EAX~0_Out1171515774)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1171515774, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1171515774, ~b~0=~b~0_In1171515774, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1171515774, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1171515774, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1171515774, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1171515774} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1171515774, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1171515774, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1171515774, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1171515774, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1171515774, ~a~0=~a~0_Out1171515774, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1171515774, ~b~0=~b~0_In1171515774, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1171515774, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1171515774, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1171515774, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1171515774, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1171515774, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1171515774, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1171515774} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 17:22:59,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-18 17:22:59,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~y~0_18 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 17:22:59,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In927800182 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In927800182 256)))) (or (and .cse0 (= (mod ~z$r_buff1_thd3~0_In927800182 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In927800182 256)) (and (= (mod ~z$w_buff1_used~0_In927800182 256) 0) .cse0))) (= |P2Thread1of1ForFork1_#t~ite8_Out927800182| ~z$w_buff0~0_In927800182) .cse1 (= |P2Thread1of1ForFork1_#t~ite9_Out927800182| |P2Thread1of1ForFork1_#t~ite8_Out927800182|)) (and (= |P2Thread1of1ForFork1_#t~ite9_Out927800182| ~z$w_buff0~0_In927800182) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite8_In927800182| |P2Thread1of1ForFork1_#t~ite8_Out927800182|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In927800182, ~z$w_buff0_used~0=~z$w_buff0_used~0_In927800182, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In927800182, ~z$w_buff1_used~0=~z$w_buff1_used~0_In927800182, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In927800182, ~weak$$choice2~0=~weak$$choice2~0_In927800182, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In927800182|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In927800182, ~z$w_buff0_used~0=~z$w_buff0_used~0_In927800182, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In927800182, ~z$w_buff1_used~0=~z$w_buff1_used~0_In927800182, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In927800182, ~weak$$choice2~0=~weak$$choice2~0_In927800182, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out927800182|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out927800182|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:22:59,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-945179644 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_In-945179644| |P2Thread1of1ForFork1_#t~ite11_Out-945179644|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out-945179644| ~z$w_buff1~0_In-945179644)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite12_Out-945179644| |P2Thread1of1ForFork1_#t~ite11_Out-945179644|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-945179644 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-945179644 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-945179644 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-945179644 256) 0)))) (= ~z$w_buff1~0_In-945179644 |P2Thread1of1ForFork1_#t~ite11_Out-945179644|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-945179644, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-945179644, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-945179644|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-945179644, ~z$w_buff1~0=~z$w_buff1~0_In-945179644, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-945179644, ~weak$$choice2~0=~weak$$choice2~0_In-945179644} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-945179644, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-945179644|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-945179644, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-945179644|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-945179644, ~z$w_buff1~0=~z$w_buff1~0_In-945179644, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-945179644, ~weak$$choice2~0=~weak$$choice2~0_In-945179644} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:22:59,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-165850753 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_In-165850753| |P2Thread1of1ForFork1_#t~ite14_Out-165850753|) (= ~z$w_buff0_used~0_In-165850753 |P2Thread1of1ForFork1_#t~ite15_Out-165850753|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-165850753 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-165850753 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-165850753 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-165850753 256))))) (= |P2Thread1of1ForFork1_#t~ite15_Out-165850753| |P2Thread1of1ForFork1_#t~ite14_Out-165850753|) (= ~z$w_buff0_used~0_In-165850753 |P2Thread1of1ForFork1_#t~ite14_Out-165850753|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-165850753|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-165850753, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-165850753, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-165850753, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-165850753, ~weak$$choice2~0=~weak$$choice2~0_In-165850753} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-165850753|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-165850753|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-165850753, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-165850753, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-165850753, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-165850753, ~weak$$choice2~0=~weak$$choice2~0_In-165850753} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-18 17:22:59,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 17:22:59,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-415151927 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite24_Out-415151927| ~z$r_buff1_thd3~0_In-415151927) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In-415151927| |P2Thread1of1ForFork1_#t~ite23_Out-415151927|)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite23_Out-415151927| |P2Thread1of1ForFork1_#t~ite24_Out-415151927|) (= |P2Thread1of1ForFork1_#t~ite23_Out-415151927| ~z$r_buff1_thd3~0_In-415151927) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-415151927 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-415151927 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In-415151927 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-415151927 256))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-415151927, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-415151927, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-415151927|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-415151927, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-415151927, ~weak$$choice2~0=~weak$$choice2~0_In-415151927} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-415151927|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-415151927, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-415151927, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-415151927|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-415151927, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-415151927, ~weak$$choice2~0=~weak$$choice2~0_In-415151927} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-18 17:22:59,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:22:59,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In412074987 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In412074987 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out412074987|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In412074987 |P3Thread1of1ForFork2_#t~ite28_Out412074987|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In412074987, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In412074987} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out412074987|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In412074987, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In412074987} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 17:22:59,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In-718275363 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-718275363 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-718275363 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-718275363 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-718275363|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-718275363 |P3Thread1of1ForFork2_#t~ite29_Out-718275363|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-718275363, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-718275363, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-718275363, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-718275363} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-718275363|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-718275363, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-718275363, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-718275363, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-718275363} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 17:22:59,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In345640770 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In345640770 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out345640770 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out345640770 ~z$r_buff0_thd4~0_In345640770)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In345640770, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In345640770} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In345640770, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out345640770, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out345640770|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-18 17:22:59,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1426683124 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1426683124 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1426683124 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1426683124 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out-1426683124| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite31_Out-1426683124| ~z$r_buff1_thd4~0_In-1426683124) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1426683124, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426683124, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1426683124, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426683124} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1426683124, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426683124, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1426683124, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426683124, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1426683124|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:22:59,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:22:59,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:22:59,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite37_Out1243856399| |ULTIMATE.start_main_#t~ite36_Out1243856399|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1243856399 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1243856399 256) 0))) (or (and .cse0 (= ~z~0_In1243856399 |ULTIMATE.start_main_#t~ite36_Out1243856399|) (or .cse1 .cse2)) (and .cse0 (= ~z$w_buff1~0_In1243856399 |ULTIMATE.start_main_#t~ite36_Out1243856399|) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1243856399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1243856399, ~z$w_buff1~0=~z$w_buff1~0_In1243856399, ~z~0=~z~0_In1243856399} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1243856399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1243856399, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1243856399|, ~z$w_buff1~0=~z$w_buff1~0_In1243856399, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1243856399|, ~z~0=~z~0_In1243856399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:22:59,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1847585866 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1847585866 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out1847585866|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1847585866 |ULTIMATE.start_main_#t~ite38_Out1847585866|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1847585866, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1847585866} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1847585866, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1847585866, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1847585866|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:22:59,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1485967104 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1485967104 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1485967104 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1485967104 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1485967104 |ULTIMATE.start_main_#t~ite39_Out-1485967104|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1485967104|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1485967104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1485967104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1485967104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1485967104} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1485967104, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1485967104|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1485967104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1485967104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1485967104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:22:59,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-719714567 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-719714567 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out-719714567|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-719714567| ~z$r_buff0_thd0~0_In-719714567)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-719714567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-719714567} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-719714567, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-719714567|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-719714567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:22:59,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-919531764 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-919531764 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-919531764 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-919531764 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out-919531764| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-919531764| ~z$r_buff1_thd0~0_In-919531764) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-919531764, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-919531764, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-919531764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-919531764} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-919531764|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-919531764, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-919531764, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-919531764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-919531764} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 17:22:59,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:22:59,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:22:59 BasicIcfg [2019-12-18 17:22:59,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:22:59,518 INFO L168 Benchmark]: Toolchain (without parser) took 31010.21 ms. Allocated memory was 135.3 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 98.5 MB in the beginning and 425.9 MB in the end (delta: -327.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 17:22:59,519 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 17:22:59,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.81 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 98.1 MB in the beginning and 152.8 MB in the end (delta: -54.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:22:59,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.68 ms. Allocated memory is still 199.2 MB. Free memory was 152.8 MB in the beginning and 149.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:22:59,524 INFO L168 Benchmark]: Boogie Preprocessor took 62.47 ms. Allocated memory is still 199.2 MB. Free memory was 149.9 MB in the beginning and 147.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:22:59,525 INFO L168 Benchmark]: RCFGBuilder took 819.26 ms. Allocated memory is still 199.2 MB. Free memory was 147.8 MB in the beginning and 101.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:22:59,525 INFO L168 Benchmark]: TraceAbstraction took 29379.97 ms. Allocated memory was 199.2 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 101.3 MB in the beginning and 425.9 MB in the end (delta: -324.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 17:22:59,530 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 680.81 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 98.1 MB in the beginning and 152.8 MB in the end (delta: -54.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.68 ms. Allocated memory is still 199.2 MB. Free memory was 152.8 MB in the beginning and 149.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.47 ms. Allocated memory is still 199.2 MB. Free memory was 149.9 MB in the beginning and 147.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.26 ms. Allocated memory is still 199.2 MB. Free memory was 147.8 MB in the beginning and 101.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29379.97 ms. Allocated memory was 199.2 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 101.3 MB in the beginning and 425.9 MB in the end (delta: -324.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1053, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1054, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1055, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1056, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1803 SDtfs, 2505 SDslu, 2888 SDs, 0 SdLazy, 1050 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31012occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 15555 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 29896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...