/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:28:17,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:28:17,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:28:17,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:28:17,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:28:17,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:28:17,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:28:17,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:28:17,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:28:17,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:28:17,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:28:17,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:28:17,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:28:17,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:28:17,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:28:17,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:28:17,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:28:17,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:28:17,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:28:17,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:28:17,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:28:17,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:28:17,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:28:17,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:28:17,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:28:17,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:28:17,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:28:17,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:28:17,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:28:17,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:28:17,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:28:17,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:28:17,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:28:17,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:28:17,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:28:17,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:28:17,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:28:17,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:28:17,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:28:17,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:28:17,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:28:17,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:28:17,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:28:17,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:28:17,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:28:17,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:28:17,372 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:28:17,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:28:17,372 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:28:17,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:28:17,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:28:17,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:28:17,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:28:17,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:28:17,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:28:17,373 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:28:17,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:28:17,374 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:28:17,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:28:17,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:28:17,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:28:17,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:28:17,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:28:17,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:28:17,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:28:17,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:28:17,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:28:17,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:28:17,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:28:17,380 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:28:17,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:28:17,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:28:17,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:28:17,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:28:17,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:28:17,663 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:28:17,664 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:28:17,664 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i [2019-12-18 20:28:17,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a547a9d/2ebaf2a0b77c4fc2adc91762b383906c/FLAG56d9bf583 [2019-12-18 20:28:18,255 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:28:18,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i [2019-12-18 20:28:18,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a547a9d/2ebaf2a0b77c4fc2adc91762b383906c/FLAG56d9bf583 [2019-12-18 20:28:18,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a547a9d/2ebaf2a0b77c4fc2adc91762b383906c [2019-12-18 20:28:18,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:28:18,566 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:28:18,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:28:18,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:28:18,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:28:18,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:28:18" (1/1) ... [2019-12-18 20:28:18,575 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 08:28:18, skipping insertion in model container [2019-12-18 20:28:18,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:28:18" (1/1) ... [2019-12-18 20:28:18,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:28:18,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:28:19,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:28:19,190 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:28:19,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:28:19,362 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:28:19,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19 WrapperNode [2019-12-18 20:28:19,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:28:19,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:28:19,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:28:19,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:28:19,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (1/1) ... [2019-12-18 20:28:19,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (1/1) ... [2019-12-18 20:28:19,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:28:19,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:28:19,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:28:19,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:28:19,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (1/1) ... [2019-12-18 20:28:19,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (1/1) ... [2019-12-18 20:28:19,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (1/1) ... [2019-12-18 20:28:19,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (1/1) ... [2019-12-18 20:28:19,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (1/1) ... [2019-12-18 20:28:19,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (1/1) ... [2019-12-18 20:28:19,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (1/1) ... [2019-12-18 20:28:19,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:28:19,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:28:19,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:28:19,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:28:19,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (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 20:28:19,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:28:19,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:28:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:28:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:28:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:28:19,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:28:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:28:19,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:28:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:28:19,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:28:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 20:28:19,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 20:28:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:28:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:28:19,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:28:19,535 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 20:28:20,277 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:28:20,277 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:28:20,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:28:20 BoogieIcfgContainer [2019-12-18 20:28:20,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:28:20,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:28:20,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:28:20,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:28:20,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:28:18" (1/3) ... [2019-12-18 20:28:20,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79aeba4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:28:20, skipping insertion in model container [2019-12-18 20:28:20,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:28:19" (2/3) ... [2019-12-18 20:28:20,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79aeba4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:28:20, skipping insertion in model container [2019-12-18 20:28:20,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:28:20" (3/3) ... [2019-12-18 20:28:20,287 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_power.opt.i [2019-12-18 20:28:20,298 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:28:20,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:28:20,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:28:20,307 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:28:20,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,349 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,350 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,391 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,391 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,392 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,392 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,392 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,398 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,398 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,398 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,398 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,408 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,411 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,422 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,422 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,428 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,432 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,433 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,433 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:28:20,449 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 20:28:20,471 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:28:20,471 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:28:20,471 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:28:20,471 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:28:20,471 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:28:20,471 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:28:20,471 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:28:20,472 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:28:20,488 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 20:28:20,490 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 20:28:20,583 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 20:28:20,583 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:28:20,602 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:28:20,630 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 20:28:20,684 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 20:28:20,685 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:28:20,693 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:28:20,715 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 20:28:20,716 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:28:24,442 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-18 20:28:24,757 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 20:28:24,902 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 20:28:24,923 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74863 [2019-12-18 20:28:24,923 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-18 20:28:24,927 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 94 transitions [2019-12-18 20:28:58,739 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 165606 states. [2019-12-18 20:28:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 165606 states. [2019-12-18 20:28:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:28:58,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:58,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:28:58,748 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash -285837663, now seen corresponding path program 1 times [2019-12-18 20:28:58,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:58,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798860230] [2019-12-18 20:28:58,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:59,046 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 20:28:59,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798860230] [2019-12-18 20:28:59,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:59,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:28:59,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456284088] [2019-12-18 20:28:59,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:28:59,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:59,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:28:59,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:59,071 INFO L87 Difference]: Start difference. First operand 165606 states. Second operand 3 states. [2019-12-18 20:29:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:04,550 INFO L93 Difference]: Finished difference Result 163626 states and 782690 transitions. [2019-12-18 20:29:04,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:29:04,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:29:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:05,434 INFO L225 Difference]: With dead ends: 163626 [2019-12-18 20:29:05,434 INFO L226 Difference]: Without dead ends: 154266 [2019-12-18 20:29:05,436 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 20:29:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154266 states. [2019-12-18 20:29:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154266 to 154266. [2019-12-18 20:29:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154266 states. [2019-12-18 20:29:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154266 states to 154266 states and 736982 transitions. [2019-12-18 20:29:17,933 INFO L78 Accepts]: Start accepts. Automaton has 154266 states and 736982 transitions. Word has length 7 [2019-12-18 20:29:17,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:17,934 INFO L462 AbstractCegarLoop]: Abstraction has 154266 states and 736982 transitions. [2019-12-18 20:29:17,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:29:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 154266 states and 736982 transitions. [2019-12-18 20:29:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:29:17,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:17,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:29:17,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:29:17,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:17,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1421349496, now seen corresponding path program 1 times [2019-12-18 20:29:17,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:17,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785028883] [2019-12-18 20:29:17,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:23,219 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 20:29:23,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785028883] [2019-12-18 20:29:23,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:23,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:29:23,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866696033] [2019-12-18 20:29:23,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:29:23,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:23,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:29:23,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:29:23,223 INFO L87 Difference]: Start difference. First operand 154266 states and 736982 transitions. Second operand 4 states. [2019-12-18 20:29:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:25,665 INFO L93 Difference]: Finished difference Result 243762 states and 1119228 transitions. [2019-12-18 20:29:25,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:29:25,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 20:29:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:26,588 INFO L225 Difference]: With dead ends: 243762 [2019-12-18 20:29:26,589 INFO L226 Difference]: Without dead ends: 243552 [2019-12-18 20:29:26,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:29:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243552 states. [2019-12-18 20:29:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243552 to 227200. [2019-12-18 20:29:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227200 states. [2019-12-18 20:29:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227200 states to 227200 states and 1051313 transitions. [2019-12-18 20:29:48,092 INFO L78 Accepts]: Start accepts. Automaton has 227200 states and 1051313 transitions. Word has length 15 [2019-12-18 20:29:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:29:48,092 INFO L462 AbstractCegarLoop]: Abstraction has 227200 states and 1051313 transitions. [2019-12-18 20:29:48,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:29:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 227200 states and 1051313 transitions. [2019-12-18 20:29:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:29:48,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:29:48,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:29:48,097 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:29:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:29:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash 965433143, now seen corresponding path program 1 times [2019-12-18 20:29:48,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:29:48,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748449852] [2019-12-18 20:29:48,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:29:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:29:48,173 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 20:29:48,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748449852] [2019-12-18 20:29:48,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:29:48,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:29:48,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181111784] [2019-12-18 20:29:48,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:29:48,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:29:48,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:29:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:29:48,176 INFO L87 Difference]: Start difference. First operand 227200 states and 1051313 transitions. Second operand 3 states. [2019-12-18 20:29:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:29:55,617 INFO L93 Difference]: Finished difference Result 141525 states and 590029 transitions. [2019-12-18 20:29:55,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:29:55,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 20:29:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:29:56,188 INFO L225 Difference]: With dead ends: 141525 [2019-12-18 20:29:56,189 INFO L226 Difference]: Without dead ends: 141525 [2019-12-18 20:29:56,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:30:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141525 states. [2019-12-18 20:30:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141525 to 141525. [2019-12-18 20:30:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141525 states. [2019-12-18 20:30:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141525 states to 141525 states and 590029 transitions. [2019-12-18 20:30:08,753 INFO L78 Accepts]: Start accepts. Automaton has 141525 states and 590029 transitions. Word has length 15 [2019-12-18 20:30:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:08,753 INFO L462 AbstractCegarLoop]: Abstraction has 141525 states and 590029 transitions. [2019-12-18 20:30:08,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:30:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 141525 states and 590029 transitions. [2019-12-18 20:30:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:30:08,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:08,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:08,759 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 353132370, now seen corresponding path program 1 times [2019-12-18 20:30:08,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:08,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479085726] [2019-12-18 20:30:08,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:08,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 20:30:08,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479085726] [2019-12-18 20:30:08,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:08,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:30:08,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897811522] [2019-12-18 20:30:08,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:30:08,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:08,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:30:08,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:30:08,817 INFO L87 Difference]: Start difference. First operand 141525 states and 590029 transitions. Second operand 4 states. [2019-12-18 20:30:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:09,015 INFO L93 Difference]: Finished difference Result 38307 states and 135561 transitions. [2019-12-18 20:30:09,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:30:09,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:30:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:09,090 INFO L225 Difference]: With dead ends: 38307 [2019-12-18 20:30:09,090 INFO L226 Difference]: Without dead ends: 38307 [2019-12-18 20:30:09,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:30:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38307 states. [2019-12-18 20:30:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38307 to 38307. [2019-12-18 20:30:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38307 states. [2019-12-18 20:30:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38307 states to 38307 states and 135561 transitions. [2019-12-18 20:30:09,819 INFO L78 Accepts]: Start accepts. Automaton has 38307 states and 135561 transitions. Word has length 16 [2019-12-18 20:30:09,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:09,819 INFO L462 AbstractCegarLoop]: Abstraction has 38307 states and 135561 transitions. [2019-12-18 20:30:09,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:30:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 38307 states and 135561 transitions. [2019-12-18 20:30:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:30:09,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:09,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:09,823 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:09,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:09,823 INFO L82 PathProgramCache]: Analyzing trace with hash 155833959, now seen corresponding path program 1 times [2019-12-18 20:30:09,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:09,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678880995] [2019-12-18 20:30:09,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:09,883 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 20:30:09,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678880995] [2019-12-18 20:30:09,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:09,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:30:09,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608643710] [2019-12-18 20:30:09,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:30:09,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:30:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:30:09,885 INFO L87 Difference]: Start difference. First operand 38307 states and 135561 transitions. Second operand 4 states. [2019-12-18 20:30:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:12,784 INFO L93 Difference]: Finished difference Result 48375 states and 169656 transitions. [2019-12-18 20:30:12,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:30:12,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:30:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:12,885 INFO L225 Difference]: With dead ends: 48375 [2019-12-18 20:30:12,885 INFO L226 Difference]: Without dead ends: 48364 [2019-12-18 20:30:12,886 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 20:30:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48364 states. [2019-12-18 20:30:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48364 to 42700. [2019-12-18 20:30:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42700 states. [2019-12-18 20:30:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42700 states to 42700 states and 150756 transitions. [2019-12-18 20:30:13,712 INFO L78 Accepts]: Start accepts. Automaton has 42700 states and 150756 transitions. Word has length 16 [2019-12-18 20:30:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:13,712 INFO L462 AbstractCegarLoop]: Abstraction has 42700 states and 150756 transitions. [2019-12-18 20:30:13,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:30:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 42700 states and 150756 transitions. [2019-12-18 20:30:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:30:13,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:13,728 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 20:30:13,728 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:13,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash -2135022272, now seen corresponding path program 1 times [2019-12-18 20:30:13,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:13,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809683428] [2019-12-18 20:30:13,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:13,850 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 20:30:13,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809683428] [2019-12-18 20:30:13,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:13,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:30:13,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147753140] [2019-12-18 20:30:13,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:30:13,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:30:13,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:30:13,852 INFO L87 Difference]: Start difference. First operand 42700 states and 150756 transitions. Second operand 5 states. [2019-12-18 20:30:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:14,499 INFO L93 Difference]: Finished difference Result 53510 states and 186118 transitions. [2019-12-18 20:30:14,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:30:14,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 20:30:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:15,043 INFO L225 Difference]: With dead ends: 53510 [2019-12-18 20:30:15,043 INFO L226 Difference]: Without dead ends: 53487 [2019-12-18 20:30:15,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:30:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53487 states. [2019-12-18 20:30:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53487 to 42005. [2019-12-18 20:30:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42005 states. [2019-12-18 20:30:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42005 states to 42005 states and 148074 transitions. [2019-12-18 20:30:15,858 INFO L78 Accepts]: Start accepts. Automaton has 42005 states and 148074 transitions. Word has length 24 [2019-12-18 20:30:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:15,858 INFO L462 AbstractCegarLoop]: Abstraction has 42005 states and 148074 transitions. [2019-12-18 20:30:15,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:30:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 42005 states and 148074 transitions. [2019-12-18 20:30:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:30:15,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:15,880 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] [2019-12-18 20:30:15,880 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:15,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1706816570, now seen corresponding path program 1 times [2019-12-18 20:30:15,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:15,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120100178] [2019-12-18 20:30:15,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:15,951 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 20:30:15,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120100178] [2019-12-18 20:30:15,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:15,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:30:15,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354183338] [2019-12-18 20:30:15,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:30:15,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:15,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:30:15,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:30:15,953 INFO L87 Difference]: Start difference. First operand 42005 states and 148074 transitions. Second operand 5 states. [2019-12-18 20:30:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:16,080 INFO L93 Difference]: Finished difference Result 21498 states and 76764 transitions. [2019-12-18 20:30:16,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:30:16,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:30:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:16,121 INFO L225 Difference]: With dead ends: 21498 [2019-12-18 20:30:16,122 INFO L226 Difference]: Without dead ends: 21498 [2019-12-18 20:30:16,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:30:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21498 states. [2019-12-18 20:30:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21498 to 21306. [2019-12-18 20:30:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21306 states. [2019-12-18 20:30:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21306 states to 21306 states and 76108 transitions. [2019-12-18 20:30:16,891 INFO L78 Accepts]: Start accepts. Automaton has 21306 states and 76108 transitions. Word has length 28 [2019-12-18 20:30:16,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:16,891 INFO L462 AbstractCegarLoop]: Abstraction has 21306 states and 76108 transitions. [2019-12-18 20:30:16,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:30:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 21306 states and 76108 transitions. [2019-12-18 20:30:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:30:16,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:16,926 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] [2019-12-18 20:30:16,926 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:16,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1629751536, now seen corresponding path program 1 times [2019-12-18 20:30:16,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:16,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364042428] [2019-12-18 20:30:16,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:17,001 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 20:30:17,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364042428] [2019-12-18 20:30:17,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:17,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:30:17,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174589795] [2019-12-18 20:30:17,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:30:17,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:17,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:30:17,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:30:17,003 INFO L87 Difference]: Start difference. First operand 21306 states and 76108 transitions. Second operand 4 states. [2019-12-18 20:30:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:17,196 INFO L93 Difference]: Finished difference Result 30881 states and 105340 transitions. [2019-12-18 20:30:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:30:17,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 20:30:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:17,259 INFO L225 Difference]: With dead ends: 30881 [2019-12-18 20:30:17,259 INFO L226 Difference]: Without dead ends: 21608 [2019-12-18 20:30:17,259 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 20:30:17,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21608 states. [2019-12-18 20:30:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21608 to 21512. [2019-12-18 20:30:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21512 states. [2019-12-18 20:30:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21512 states to 21512 states and 75947 transitions. [2019-12-18 20:30:17,725 INFO L78 Accepts]: Start accepts. Automaton has 21512 states and 75947 transitions. Word has length 42 [2019-12-18 20:30:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:17,725 INFO L462 AbstractCegarLoop]: Abstraction has 21512 states and 75947 transitions. [2019-12-18 20:30:17,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:30:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 21512 states and 75947 transitions. [2019-12-18 20:30:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:30:17,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:17,760 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] [2019-12-18 20:30:17,760 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1940145770, now seen corresponding path program 2 times [2019-12-18 20:30:17,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:17,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879675664] [2019-12-18 20:30:17,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:17,829 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 20:30:17,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879675664] [2019-12-18 20:30:17,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:17,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:30:17,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576576070] [2019-12-18 20:30:17,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:30:17,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:17,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:30:17,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:30:17,831 INFO L87 Difference]: Start difference. First operand 21512 states and 75947 transitions. Second operand 4 states. [2019-12-18 20:30:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:17,986 INFO L93 Difference]: Finished difference Result 34397 states and 122371 transitions. [2019-12-18 20:30:17,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:30:17,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 20:30:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:18,022 INFO L225 Difference]: With dead ends: 34397 [2019-12-18 20:30:18,022 INFO L226 Difference]: Without dead ends: 18368 [2019-12-18 20:30:18,023 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 20:30:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18368 states. [2019-12-18 20:30:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18368 to 18290. [2019-12-18 20:30:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2019-12-18 20:30:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 63856 transitions. [2019-12-18 20:30:18,362 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 63856 transitions. Word has length 42 [2019-12-18 20:30:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:18,362 INFO L462 AbstractCegarLoop]: Abstraction has 18290 states and 63856 transitions. [2019-12-18 20:30:18,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:30:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 63856 transitions. [2019-12-18 20:30:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:30:18,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:18,387 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] [2019-12-18 20:30:18,387 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:18,387 INFO L82 PathProgramCache]: Analyzing trace with hash -254857110, now seen corresponding path program 3 times [2019-12-18 20:30:18,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:18,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095097453] [2019-12-18 20:30:18,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:18,485 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 20:30:18,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095097453] [2019-12-18 20:30:18,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:18,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:30:18,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293934534] [2019-12-18 20:30:18,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:30:18,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:30:18,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:30:18,487 INFO L87 Difference]: Start difference. First operand 18290 states and 63856 transitions. Second operand 6 states. [2019-12-18 20:30:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:18,598 INFO L93 Difference]: Finished difference Result 17048 states and 60717 transitions. [2019-12-18 20:30:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:30:18,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 20:30:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:18,626 INFO L225 Difference]: With dead ends: 17048 [2019-12-18 20:30:18,627 INFO L226 Difference]: Without dead ends: 13450 [2019-12-18 20:30:18,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:30:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13450 states. [2019-12-18 20:30:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13450 to 13050. [2019-12-18 20:30:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13050 states. [2019-12-18 20:30:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13050 states to 13050 states and 47484 transitions. [2019-12-18 20:30:19,075 INFO L78 Accepts]: Start accepts. Automaton has 13050 states and 47484 transitions. Word has length 42 [2019-12-18 20:30:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:19,076 INFO L462 AbstractCegarLoop]: Abstraction has 13050 states and 47484 transitions. [2019-12-18 20:30:19,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:30:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 13050 states and 47484 transitions. [2019-12-18 20:30:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:30:19,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:19,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:19,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:19,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:19,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1833036015, now seen corresponding path program 1 times [2019-12-18 20:30:19,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:19,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156150999] [2019-12-18 20:30:19,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:19,206 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 20:30:19,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156150999] [2019-12-18 20:30:19,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:19,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:30:19,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980251019] [2019-12-18 20:30:19,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:30:19,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:30:19,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:30:19,209 INFO L87 Difference]: Start difference. First operand 13050 states and 47484 transitions. Second operand 4 states. [2019-12-18 20:30:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:19,306 INFO L93 Difference]: Finished difference Result 16902 states and 60194 transitions. [2019-12-18 20:30:19,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:30:19,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 20:30:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:19,317 INFO L225 Difference]: With dead ends: 16902 [2019-12-18 20:30:19,317 INFO L226 Difference]: Without dead ends: 4163 [2019-12-18 20:30:19,317 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 20:30:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2019-12-18 20:30:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 4163. [2019-12-18 20:30:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-12-18 20:30:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 13587 transitions. [2019-12-18 20:30:19,448 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 13587 transitions. Word has length 57 [2019-12-18 20:30:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:19,449 INFO L462 AbstractCegarLoop]: Abstraction has 4163 states and 13587 transitions. [2019-12-18 20:30:19,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:30:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 13587 transitions. [2019-12-18 20:30:19,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:30:19,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:19,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:19,457 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:19,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1816371613, now seen corresponding path program 2 times [2019-12-18 20:30:19,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:19,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232079828] [2019-12-18 20:30:19,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:19,554 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 20:30:19,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232079828] [2019-12-18 20:30:19,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:19,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:30:19,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645882597] [2019-12-18 20:30:19,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:30:19,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:19,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:30:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:30:19,557 INFO L87 Difference]: Start difference. First operand 4163 states and 13587 transitions. Second operand 7 states. [2019-12-18 20:30:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:19,813 INFO L93 Difference]: Finished difference Result 8316 states and 26619 transitions. [2019-12-18 20:30:19,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:30:19,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:30:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:19,826 INFO L225 Difference]: With dead ends: 8316 [2019-12-18 20:30:19,827 INFO L226 Difference]: Without dead ends: 6024 [2019-12-18 20:30:19,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:30:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2019-12-18 20:30:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 5378. [2019-12-18 20:30:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5378 states. [2019-12-18 20:30:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 17440 transitions. [2019-12-18 20:30:19,995 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 17440 transitions. Word has length 57 [2019-12-18 20:30:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:19,996 INFO L462 AbstractCegarLoop]: Abstraction has 5378 states and 17440 transitions. [2019-12-18 20:30:19,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:30:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 17440 transitions. [2019-12-18 20:30:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:30:20,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:20,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:20,006 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:20,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:20,006 INFO L82 PathProgramCache]: Analyzing trace with hash 952900063, now seen corresponding path program 3 times [2019-12-18 20:30:20,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:20,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439719135] [2019-12-18 20:30:20,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:20,096 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 20:30:20,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439719135] [2019-12-18 20:30:20,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:20,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:30:20,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933587628] [2019-12-18 20:30:20,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:30:20,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:20,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:30:20,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:30:20,098 INFO L87 Difference]: Start difference. First operand 5378 states and 17440 transitions. Second operand 7 states. [2019-12-18 20:30:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:20,370 INFO L93 Difference]: Finished difference Result 9966 states and 31598 transitions. [2019-12-18 20:30:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:30:20,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:30:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:20,383 INFO L225 Difference]: With dead ends: 9966 [2019-12-18 20:30:20,383 INFO L226 Difference]: Without dead ends: 7295 [2019-12-18 20:30:20,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:30:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7295 states. [2019-12-18 20:30:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7295 to 6431. [2019-12-18 20:30:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6431 states. [2019-12-18 20:30:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6431 states to 6431 states and 20643 transitions. [2019-12-18 20:30:20,491 INFO L78 Accepts]: Start accepts. Automaton has 6431 states and 20643 transitions. Word has length 57 [2019-12-18 20:30:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:20,492 INFO L462 AbstractCegarLoop]: Abstraction has 6431 states and 20643 transitions. [2019-12-18 20:30:20,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:30:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 6431 states and 20643 transitions. [2019-12-18 20:30:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:30:20,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:20,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:20,502 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash -282768913, now seen corresponding path program 4 times [2019-12-18 20:30:20,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:20,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458060489] [2019-12-18 20:30:20,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:20,628 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 20:30:20,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458060489] [2019-12-18 20:30:20,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:20,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:30:20,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437387607] [2019-12-18 20:30:20,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:30:20,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:20,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:30:20,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:30:20,631 INFO L87 Difference]: Start difference. First operand 6431 states and 20643 transitions. Second operand 9 states. [2019-12-18 20:30:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:22,341 INFO L93 Difference]: Finished difference Result 42264 states and 136685 transitions. [2019-12-18 20:30:22,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 20:30:22,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 20:30:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:22,394 INFO L225 Difference]: With dead ends: 42264 [2019-12-18 20:30:22,394 INFO L226 Difference]: Without dead ends: 33828 [2019-12-18 20:30:22,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 20:30:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33828 states. [2019-12-18 20:30:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33828 to 9147. [2019-12-18 20:30:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9147 states. [2019-12-18 20:30:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9147 states to 9147 states and 29781 transitions. [2019-12-18 20:30:22,892 INFO L78 Accepts]: Start accepts. Automaton has 9147 states and 29781 transitions. Word has length 57 [2019-12-18 20:30:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:22,892 INFO L462 AbstractCegarLoop]: Abstraction has 9147 states and 29781 transitions. [2019-12-18 20:30:22,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:30:22,893 INFO L276 IsEmpty]: Start isEmpty. Operand 9147 states and 29781 transitions. [2019-12-18 20:30:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:30:22,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:22,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:22,907 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:22,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1223483339, now seen corresponding path program 5 times [2019-12-18 20:30:22,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:22,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038543728] [2019-12-18 20:30:22,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:23,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 20:30:23,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038543728] [2019-12-18 20:30:23,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:23,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:30:23,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806994153] [2019-12-18 20:30:23,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:30:23,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:23,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:30:23,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:30:23,017 INFO L87 Difference]: Start difference. First operand 9147 states and 29781 transitions. Second operand 9 states. [2019-12-18 20:30:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:24,556 INFO L93 Difference]: Finished difference Result 37087 states and 118538 transitions. [2019-12-18 20:30:24,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 20:30:24,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 20:30:24,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:24,605 INFO L225 Difference]: With dead ends: 37087 [2019-12-18 20:30:24,605 INFO L226 Difference]: Without dead ends: 30755 [2019-12-18 20:30:24,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 20:30:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30755 states. [2019-12-18 20:30:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30755 to 9167. [2019-12-18 20:30:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9167 states. [2019-12-18 20:30:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9167 states to 9167 states and 29928 transitions. [2019-12-18 20:30:24,910 INFO L78 Accepts]: Start accepts. Automaton has 9167 states and 29928 transitions. Word has length 57 [2019-12-18 20:30:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:24,910 INFO L462 AbstractCegarLoop]: Abstraction has 9167 states and 29928 transitions. [2019-12-18 20:30:24,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:30:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 9167 states and 29928 transitions. [2019-12-18 20:30:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:30:24,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:24,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:24,922 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash 417709041, now seen corresponding path program 6 times [2019-12-18 20:30:24,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:24,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422882882] [2019-12-18 20:30:24,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:24,995 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 20:30:24,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422882882] [2019-12-18 20:30:24,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:24,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:30:24,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242668869] [2019-12-18 20:30:24,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:30:24,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:24,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:30:24,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:30:24,997 INFO L87 Difference]: Start difference. First operand 9167 states and 29928 transitions. Second operand 3 states. [2019-12-18 20:30:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:25,051 INFO L93 Difference]: Finished difference Result 9165 states and 29923 transitions. [2019-12-18 20:30:25,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:30:25,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:30:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:25,066 INFO L225 Difference]: With dead ends: 9165 [2019-12-18 20:30:25,066 INFO L226 Difference]: Without dead ends: 9165 [2019-12-18 20:30:25,066 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 20:30:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9165 states. [2019-12-18 20:30:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9165 to 9165. [2019-12-18 20:30:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9165 states. [2019-12-18 20:30:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9165 states to 9165 states and 29923 transitions. [2019-12-18 20:30:25,236 INFO L78 Accepts]: Start accepts. Automaton has 9165 states and 29923 transitions. Word has length 57 [2019-12-18 20:30:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:25,236 INFO L462 AbstractCegarLoop]: Abstraction has 9165 states and 29923 transitions. [2019-12-18 20:30:25,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:30:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 9165 states and 29923 transitions. [2019-12-18 20:30:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:30:25,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:25,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:25,249 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:25,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:25,249 INFO L82 PathProgramCache]: Analyzing trace with hash -105178676, now seen corresponding path program 1 times [2019-12-18 20:30:25,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:25,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389423859] [2019-12-18 20:30:25,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:25,318 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 20:30:25,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389423859] [2019-12-18 20:30:25,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:25,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:30:25,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542977840] [2019-12-18 20:30:25,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:30:25,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:25,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:30:25,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:30:25,320 INFO L87 Difference]: Start difference. First operand 9165 states and 29923 transitions. Second operand 3 states. [2019-12-18 20:30:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:25,373 INFO L93 Difference]: Finished difference Result 8220 states and 26050 transitions. [2019-12-18 20:30:25,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:30:25,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 20:30:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:25,390 INFO L225 Difference]: With dead ends: 8220 [2019-12-18 20:30:25,391 INFO L226 Difference]: Without dead ends: 8220 [2019-12-18 20:30:25,391 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 20:30:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8220 states. [2019-12-18 20:30:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8220 to 7904. [2019-12-18 20:30:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7904 states. [2019-12-18 20:30:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7904 states to 7904 states and 24944 transitions. [2019-12-18 20:30:25,614 INFO L78 Accepts]: Start accepts. Automaton has 7904 states and 24944 transitions. Word has length 58 [2019-12-18 20:30:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:25,614 INFO L462 AbstractCegarLoop]: Abstraction has 7904 states and 24944 transitions. [2019-12-18 20:30:25,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:30:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7904 states and 24944 transitions. [2019-12-18 20:30:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:30:25,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:25,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:25,627 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1032412649, now seen corresponding path program 1 times [2019-12-18 20:30:25,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:25,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114570072] [2019-12-18 20:30:25,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:25,767 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 20:30:25,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114570072] [2019-12-18 20:30:25,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:25,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:30:25,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841207384] [2019-12-18 20:30:25,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:30:25,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:30:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:30:25,769 INFO L87 Difference]: Start difference. First operand 7904 states and 24944 transitions. Second operand 9 states. [2019-12-18 20:30:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:26,754 INFO L93 Difference]: Finished difference Result 12668 states and 39476 transitions. [2019-12-18 20:30:26,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 20:30:26,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-12-18 20:30:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:26,768 INFO L225 Difference]: With dead ends: 12668 [2019-12-18 20:30:26,768 INFO L226 Difference]: Without dead ends: 9222 [2019-12-18 20:30:26,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:30:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9222 states. [2019-12-18 20:30:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9222 to 8128. [2019-12-18 20:30:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8128 states. [2019-12-18 20:30:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8128 states to 8128 states and 25439 transitions. [2019-12-18 20:30:26,899 INFO L78 Accepts]: Start accepts. Automaton has 8128 states and 25439 transitions. Word has length 59 [2019-12-18 20:30:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:26,899 INFO L462 AbstractCegarLoop]: Abstraction has 8128 states and 25439 transitions. [2019-12-18 20:30:26,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:30:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8128 states and 25439 transitions. [2019-12-18 20:30:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:30:26,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:26,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:26,908 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:26,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1070518011, now seen corresponding path program 2 times [2019-12-18 20:30:26,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:26,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076870490] [2019-12-18 20:30:26,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:27,055 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 20:30:27,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076870490] [2019-12-18 20:30:27,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:27,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:30:27,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710332953] [2019-12-18 20:30:27,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:30:27,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:30:27,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:30:27,057 INFO L87 Difference]: Start difference. First operand 8128 states and 25439 transitions. Second operand 10 states. [2019-12-18 20:30:27,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:27,697 INFO L93 Difference]: Finished difference Result 11840 states and 36390 transitions. [2019-12-18 20:30:27,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:30:27,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 20:30:27,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:27,711 INFO L225 Difference]: With dead ends: 11840 [2019-12-18 20:30:27,711 INFO L226 Difference]: Without dead ends: 9382 [2019-12-18 20:30:27,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:30:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9382 states. [2019-12-18 20:30:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9382 to 8156. [2019-12-18 20:30:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8156 states. [2019-12-18 20:30:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 25440 transitions. [2019-12-18 20:30:27,845 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 25440 transitions. Word has length 59 [2019-12-18 20:30:27,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:27,845 INFO L462 AbstractCegarLoop]: Abstraction has 8156 states and 25440 transitions. [2019-12-18 20:30:27,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:30:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 25440 transitions. [2019-12-18 20:30:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:30:27,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:27,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:27,855 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:27,855 INFO L82 PathProgramCache]: Analyzing trace with hash 912465139, now seen corresponding path program 3 times [2019-12-18 20:30:27,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:27,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162668249] [2019-12-18 20:30:27,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:28,041 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 20:30:28,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162668249] [2019-12-18 20:30:28,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:28,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:30:28,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724396024] [2019-12-18 20:30:28,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:30:28,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:28,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:30:28,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:30:28,044 INFO L87 Difference]: Start difference. First operand 8156 states and 25440 transitions. Second operand 11 states. [2019-12-18 20:30:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:28,938 INFO L93 Difference]: Finished difference Result 11216 states and 34368 transitions. [2019-12-18 20:30:28,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 20:30:28,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 20:30:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:28,953 INFO L225 Difference]: With dead ends: 11216 [2019-12-18 20:30:28,953 INFO L226 Difference]: Without dead ends: 8858 [2019-12-18 20:30:28,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 20:30:28,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8858 states. [2019-12-18 20:30:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8858 to 8036. [2019-12-18 20:30:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8036 states. [2019-12-18 20:30:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8036 states to 8036 states and 25050 transitions. [2019-12-18 20:30:29,086 INFO L78 Accepts]: Start accepts. Automaton has 8036 states and 25050 transitions. Word has length 59 [2019-12-18 20:30:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:29,086 INFO L462 AbstractCegarLoop]: Abstraction has 8036 states and 25050 transitions. [2019-12-18 20:30:29,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:30:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 8036 states and 25050 transitions. [2019-12-18 20:30:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:30:29,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:29,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:29,095 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:29,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1628182047, now seen corresponding path program 4 times [2019-12-18 20:30:29,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:29,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811957016] [2019-12-18 20:30:29,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:30:29,289 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 20:30:29,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811957016] [2019-12-18 20:30:29,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:30:29,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:30:29,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284030791] [2019-12-18 20:30:29,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:30:29,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:30:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:30:29,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:30:29,291 INFO L87 Difference]: Start difference. First operand 8036 states and 25050 transitions. Second operand 12 states. [2019-12-18 20:30:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:30:29,958 INFO L93 Difference]: Finished difference Result 9012 states and 27611 transitions. [2019-12-18 20:30:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:30:29,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 20:30:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:30:29,973 INFO L225 Difference]: With dead ends: 9012 [2019-12-18 20:30:29,974 INFO L226 Difference]: Without dead ends: 8826 [2019-12-18 20:30:29,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:30:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2019-12-18 20:30:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 7896. [2019-12-18 20:30:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7896 states. [2019-12-18 20:30:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7896 states to 7896 states and 24665 transitions. [2019-12-18 20:30:30,109 INFO L78 Accepts]: Start accepts. Automaton has 7896 states and 24665 transitions. Word has length 59 [2019-12-18 20:30:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:30:30,109 INFO L462 AbstractCegarLoop]: Abstraction has 7896 states and 24665 transitions. [2019-12-18 20:30:30,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:30:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7896 states and 24665 transitions. [2019-12-18 20:30:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:30:30,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:30:30,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:30:30,118 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:30:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:30:30,118 INFO L82 PathProgramCache]: Analyzing trace with hash 317629459, now seen corresponding path program 5 times [2019-12-18 20:30:30,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:30:30,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142817596] [2019-12-18 20:30:30,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:30:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:30:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:30:30,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:30:30,236 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:30:30,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_79| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~y$r_buff0_thd1~0_7 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p3_EAX~0_15) (= 0 v_~y$w_buff1~0_26) (= v_~y~0_25 0) (= |v_#valid_77| (store .cse0 |v_ULTIMATE.start_main_~#t437~0.base_22| 1)) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~main$tmp_guard0~0_9 0) (= v_~y$r_buff0_thd3~0_24 0) (= |v_#NULL.offset_6| 0) (= |v_ULTIMATE.start_main_~#t437~0.offset_17| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_66 0) (= 0 v_~y$flush_delayed~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t437~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t437~0.base_22|) |v_ULTIMATE.start_main_~#t437~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_cnt~0_26) (= v_~y$r_buff1_thd1~0_8 0) (= v_~y$r_buff0_thd0~0_19 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t437~0.base_22| 4) |v_#length_31|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t437~0.base_22|) (= 0 v_~y$r_buff1_thd0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$w_buff0~0_27) (= v_~y$w_buff0_used~0_105 0) (= 0 v_~z~0_9) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~a~0_12 0) (= v_~y$mem_tmp~0_10 0) (= v_~y$r_buff0_thd4~0_19 0) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd2~0_42) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t437~0.base_22|)) (= 0 v_~y$r_buff1_thd4~0_18))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t438~0.offset=|v_ULTIMATE.start_main_~#t438~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_12, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ULTIMATE.start_main_~#t440~0.offset=|v_ULTIMATE.start_main_~#t440~0.offset_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ULTIMATE.start_main_~#t439~0.base=|v_ULTIMATE.start_main_~#t439~0.base_20|, ULTIMATE.start_main_~#t438~0.base=|v_ULTIMATE.start_main_~#t438~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t437~0.offset=|v_ULTIMATE.start_main_~#t437~0.offset_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_66, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_21, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t440~0.base=|v_ULTIMATE.start_main_~#t440~0.base_21|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t439~0.offset=|v_ULTIMATE.start_main_~#t439~0.offset_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t437~0.base=|v_ULTIMATE.start_main_~#t437~0.base_22|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_19, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t438~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t440~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t439~0.base, ULTIMATE.start_main_~#t438~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t437~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t440~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t439~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t437~0.base, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:30:30,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t438~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t438~0.base_11|) |v_ULTIMATE.start_main_~#t438~0.offset_10| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t438~0.base_11|)) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t438~0.base_11| 1) |v_#valid_43|) (not (= 0 |v_ULTIMATE.start_main_~#t438~0.base_11|)) (= |v_ULTIMATE.start_main_~#t438~0.offset_10| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t438~0.base_11| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t438~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t438~0.base=|v_ULTIMATE.start_main_~#t438~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t438~0.offset=|v_ULTIMATE.start_main_~#t438~0.offset_10|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t438~0.base, ULTIMATE.start_main_~#t438~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 20:30:30,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (not (= |v_ULTIMATE.start_main_~#t439~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t439~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t439~0.base_10|) |v_ULTIMATE.start_main_~#t439~0.offset_9| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t439~0.base_10|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t439~0.base_10| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t439~0.base_10|) (= |v_ULTIMATE.start_main_~#t439~0.offset_9| 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t439~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t439~0.offset=|v_ULTIMATE.start_main_~#t439~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t439~0.base=|v_ULTIMATE.start_main_~#t439~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t439~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t439~0.base] because there is no mapped edge [2019-12-18 20:30:30,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t440~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t440~0.base_13|) |v_ULTIMATE.start_main_~#t440~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t440~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t440~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t440~0.base_13| 0)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t440~0.base_13| 4) |v_#length_21|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t440~0.base_13| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t440~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t440~0.base=|v_ULTIMATE.start_main_~#t440~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t440~0.offset=|v_ULTIMATE.start_main_~#t440~0.offset_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t440~0.base, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t440~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 20:30:30,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] P2ENTRY-->L4-3: Formula: (and (= ~y$w_buff1_used~0_Out276987822 ~y$w_buff0_used~0_In276987822) (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out276987822| P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out276987822) (= 0 (mod ~y$w_buff1_used~0_Out276987822 256)) (= ~y$w_buff0_used~0_Out276987822 1) (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out276987822| 1) (= ~y$w_buff1~0_Out276987822 ~y$w_buff0~0_In276987822) (= 1 ~y$w_buff0~0_Out276987822) (= |P2Thread1of1ForFork3_#in~arg.offset_In276987822| P2Thread1of1ForFork3_~arg.offset_Out276987822) (= |P2Thread1of1ForFork3_#in~arg.base_In276987822| P2Thread1of1ForFork3_~arg.base_Out276987822)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In276987822, ~y$w_buff0~0=~y$w_buff0~0_In276987822, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In276987822|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In276987822|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out276987822, ~y$w_buff1~0=~y$w_buff1~0_Out276987822, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out276987822|, ~y$w_buff0~0=~y$w_buff0~0_Out276987822, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out276987822, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out276987822, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In276987822|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out276987822, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In276987822|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out276987822} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:30:30,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{~a~0=v_~a~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:30:30,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1351494881 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1351494881 256))) (.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out1351494881| |P3Thread1of1ForFork0_#t~ite32_Out1351494881|))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In1351494881 |P3Thread1of1ForFork0_#t~ite32_Out1351494881|)) (and (= ~y$w_buff1~0_In1351494881 |P3Thread1of1ForFork0_#t~ite32_Out1351494881|) (not .cse1) (not .cse2) .cse0))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1351494881, ~y$w_buff1~0=~y$w_buff1~0_In1351494881, ~y~0=~y~0_In1351494881, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1351494881} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1351494881, ~y$w_buff1~0=~y$w_buff1~0_In1351494881, ~y~0=~y~0_In1351494881, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1351494881|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1351494881|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1351494881} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:30:30,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-390337240 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-390337240 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-390337240|)) (and (= ~y$w_buff0_used~0_In-390337240 |P2Thread1of1ForFork3_#t~ite28_Out-390337240|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-390337240, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-390337240} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-390337240, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-390337240, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-390337240|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 20:30:30,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2108579034 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In2108579034 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out2108579034|) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out2108579034| ~y$w_buff0_used~0_In2108579034)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2108579034, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2108579034} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2108579034, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2108579034, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out2108579034|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 20:30:30,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1297609209 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1297609209 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1297609209 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1297609209 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out1297609209|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork3_#t~ite29_Out1297609209| ~y$w_buff1_used~0_In1297609209) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1297609209, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1297609209, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1297609209, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1297609209} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1297609209, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1297609209, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1297609209, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1297609209|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1297609209} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 20:30:30,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In947379975 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_In947379975| |P1Thread1of1ForFork2_#t~ite8_Out947379975|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out947379975| ~y$w_buff0~0_In947379975)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite8_Out947379975| ~y$w_buff0~0_In947379975) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In947379975 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In947379975 256))) (= (mod ~y$w_buff0_used~0_In947379975 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In947379975 256) 0)))) (= |P1Thread1of1ForFork2_#t~ite9_Out947379975| |P1Thread1of1ForFork2_#t~ite8_Out947379975|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In947379975, ~y$w_buff0_used~0=~y$w_buff0_used~0_In947379975, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In947379975|, ~y$w_buff0~0=~y$w_buff0~0_In947379975, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In947379975, ~weak$$choice2~0=~weak$$choice2~0_In947379975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In947379975} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In947379975, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out947379975|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In947379975, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out947379975|, ~y$w_buff0~0=~y$w_buff0~0_In947379975, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In947379975, ~weak$$choice2~0=~weak$$choice2~0_In947379975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In947379975} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 20:30:30,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1714974384 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1714974384 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In1714974384 256) 0)) (= (mod ~y$w_buff0_used~0_In1714974384 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1714974384 256))))) (= ~y$w_buff1~0_In1714974384 |P1Thread1of1ForFork2_#t~ite11_Out1714974384|) (= |P1Thread1of1ForFork2_#t~ite12_Out1714974384| |P1Thread1of1ForFork2_#t~ite11_Out1714974384|) .cse1) (and (= |P1Thread1of1ForFork2_#t~ite12_Out1714974384| ~y$w_buff1~0_In1714974384) (= |P1Thread1of1ForFork2_#t~ite11_In1714974384| |P1Thread1of1ForFork2_#t~ite11_Out1714974384|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1714974384, ~y$w_buff1~0=~y$w_buff1~0_In1714974384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1714974384, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1714974384, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1714974384|, ~weak$$choice2~0=~weak$$choice2~0_In1714974384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1714974384} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1714974384, ~y$w_buff1~0=~y$w_buff1~0_In1714974384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1714974384, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1714974384, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1714974384|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1714974384|, ~weak$$choice2~0=~weak$$choice2~0_In1714974384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1714974384} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:30:30,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1839978182 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1839978182 256)))) (or (and (= ~y$r_buff0_thd3~0_Out-1839978182 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-1839978182 ~y$r_buff0_thd3~0_Out-1839978182)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1839978182, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1839978182} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1839978182|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1839978182, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1839978182} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 20:30:30,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-564632895 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-564632895 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-564632895 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-564632895 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-564632895 |P2Thread1of1ForFork3_#t~ite31_Out-564632895|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-564632895|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-564632895, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-564632895, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-564632895, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-564632895} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-564632895, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-564632895, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-564632895, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-564632895|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-564632895} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 20:30:30,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_13) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 20:30:30,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd4~0_In-1925375327 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1925375327 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1925375327 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd4~0_In-1925375327 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1925375327| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite35_Out-1925375327| ~y$w_buff1_used~0_In-1925375327) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1925375327, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1925375327, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1925375327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1925375327} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1925375327, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1925375327, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1925375327, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1925375327|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1925375327} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 20:30:30,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-355473050 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-355473050 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite36_Out-355473050| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-355473050| ~y$r_buff0_thd4~0_In-355473050)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-355473050, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-355473050} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-355473050, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-355473050, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-355473050|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 20:30:30,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-137159647 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-137159647 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-137159647 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-137159647 256)))) (or (and (= ~y$r_buff1_thd4~0_In-137159647 |P3Thread1of1ForFork0_#t~ite37_Out-137159647|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-137159647|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-137159647, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-137159647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-137159647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-137159647} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-137159647, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-137159647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-137159647, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-137159647|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-137159647} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 20:30:30,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:30:30,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1197839756 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1197839756 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1197839756 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1197839756 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1197839756 256))))) (= ~y$w_buff0_used~0_In1197839756 |P1Thread1of1ForFork2_#t~ite14_Out1197839756|) (= |P1Thread1of1ForFork2_#t~ite14_Out1197839756| |P1Thread1of1ForFork2_#t~ite15_Out1197839756|)) (and (= ~y$w_buff0_used~0_In1197839756 |P1Thread1of1ForFork2_#t~ite15_Out1197839756|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In1197839756| |P1Thread1of1ForFork2_#t~ite14_Out1197839756|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1197839756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1197839756, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1197839756, ~weak$$choice2~0=~weak$$choice2~0_In1197839756, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1197839756|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1197839756} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1197839756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1197839756, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1197839756, ~weak$$choice2~0=~weak$$choice2~0_In1197839756, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1197839756|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1197839756|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1197839756} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 20:30:30,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff0_thd2~0_52)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:30:30,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-781630561 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-781630561| |P1Thread1of1ForFork2_#t~ite23_Out-781630561|) (= ~y$r_buff1_thd2~0_In-781630561 |P1Thread1of1ForFork2_#t~ite23_Out-781630561|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-781630561 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-781630561 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-781630561 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-781630561 256) 0)))) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In-781630561| |P1Thread1of1ForFork2_#t~ite23_Out-781630561|) (= |P1Thread1of1ForFork2_#t~ite24_Out-781630561| ~y$r_buff1_thd2~0_In-781630561)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-781630561, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-781630561, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-781630561, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-781630561|, ~weak$$choice2~0=~weak$$choice2~0_In-781630561, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-781630561} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-781630561, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-781630561, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-781630561, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-781630561|, ~weak$$choice2~0=~weak$$choice2~0_In-781630561, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-781630561|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-781630561} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 20:30:30,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y~0_16 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:30:30,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:30:30,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2141528988 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2141528988 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-2141528988 |ULTIMATE.start_main_#t~ite42_Out-2141528988|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-2141528988| ~y$w_buff1~0_In-2141528988)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2141528988, ~y~0=~y~0_In-2141528988, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2141528988, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2141528988} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2141528988, ~y~0=~y~0_In-2141528988, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2141528988|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2141528988, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2141528988} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:30:30,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite42_8|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_7|, ~y~0=v_~y~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:30:30,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-178436303 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-178436303 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-178436303| ~y$w_buff0_used~0_In-178436303) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-178436303|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-178436303, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-178436303} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-178436303, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-178436303, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-178436303|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:30:30,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In540460201 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In540460201 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In540460201 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In540460201 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out540460201| ~y$w_buff1_used~0_In540460201) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out540460201|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In540460201, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In540460201, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In540460201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540460201} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In540460201, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In540460201, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In540460201, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out540460201|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540460201} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:30:30,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1276435502 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1276435502 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1276435502 |ULTIMATE.start_main_#t~ite46_Out1276435502|)) (and (= |ULTIMATE.start_main_#t~ite46_Out1276435502| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1276435502, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1276435502} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1276435502, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1276435502, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1276435502|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:30:30,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-210347384 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-210347384 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-210347384 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-210347384 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-210347384| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-210347384| ~y$r_buff1_thd0~0_In-210347384) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-210347384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-210347384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-210347384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-210347384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-210347384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-210347384, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-210347384|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-210347384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-210347384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:30:30,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p2_EAX~0_11) (= |v_ULTIMATE.start_main_#t~ite47_17| v_~y$r_buff1_thd0~0_16) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_11) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~__unbuffered_p0_EAX~0_12) (= 1 v_~__unbuffered_p3_EAX~0_11)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:30:30,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:30:30 BasicIcfg [2019-12-18 20:30:30,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:30:30,358 INFO L168 Benchmark]: Toolchain (without parser) took 131791.83 ms. Allocated memory was 146.3 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 102.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 20:30:30,358 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 20:30:30,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.54 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.0 MB in the beginning and 157.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:30:30,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.53 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:30:30,360 INFO L168 Benchmark]: Boogie Preprocessor took 38.90 ms. Allocated memory is still 204.5 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:30:30,360 INFO L168 Benchmark]: RCFGBuilder took 810.53 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 103.1 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:30:30,361 INFO L168 Benchmark]: TraceAbstraction took 130075.92 ms. Allocated memory was 204.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 20:30:30,364 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.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.54 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.0 MB in the beginning and 157.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.53 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.90 ms. Allocated memory is still 204.5 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.53 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 103.1 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130075.92 ms. Allocated memory was 204.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 182 ProgramPointsBefore, 89 ProgramPointsAfterwards, 210 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 28 ChoiceCompositions, 7202 VarBasedMoverChecksPositive, 204 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 74863 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = z [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L755] 2 x = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 129.7s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3666 SDtfs, 6976 SDslu, 12235 SDs, 0 SdLazy, 4414 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227200occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 53.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 86431 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 942 NumberOfCodeBlocks, 942 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 862 ConstructedInterpolants, 0 QuantifiedInterpolants, 150400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...