/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:20:07,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:20:07,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:20:07,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:20:07,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:20:07,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:20:07,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:20:07,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:20:07,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:20:07,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:20:07,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:20:07,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:20:07,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:20:07,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:20:07,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:20:07,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:20:07,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:20:07,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:20:07,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:20:07,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:20:07,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:20:07,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:20:07,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:20:07,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:20:07,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:20:07,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:20:07,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:20:07,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:20:07,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:20:07,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:20:07,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:20:07,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:20:07,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:20:07,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:20:07,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:20:07,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:20:07,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:20:07,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:20:07,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:20:07,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:20:07,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:20:07,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:20:07,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:20:07,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:20:07,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:20:07,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:20:07,235 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:20:07,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:20:07,235 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:20:07,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:20:07,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:20:07,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:20:07,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:20:07,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:20:07,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:20:07,237 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:20:07,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:20:07,237 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:20:07,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:20:07,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:20:07,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:20:07,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:20:07,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:20:07,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:20:07,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:20:07,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:20:07,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:20:07,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:20:07,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:20:07,239 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:20:07,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:20:07,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:20:07,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:20:07,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:20:07,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:20:07,546 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:20:07,546 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:20:07,547 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i [2019-12-18 21:20:07,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9920824b0/7d1ddc951f2f4617b24ecb8102ef456c/FLAGe2a4f14e8 [2019-12-18 21:20:08,161 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:20:08,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i [2019-12-18 21:20:08,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9920824b0/7d1ddc951f2f4617b24ecb8102ef456c/FLAGe2a4f14e8 [2019-12-18 21:20:08,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9920824b0/7d1ddc951f2f4617b24ecb8102ef456c [2019-12-18 21:20:08,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:20:08,435 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:20:08,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:20:08,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:20:08,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:20:08,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:20:08" (1/1) ... [2019-12-18 21:20:08,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e5d574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:08, skipping insertion in model container [2019-12-18 21:20:08,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:20:08" (1/1) ... [2019-12-18 21:20:08,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:20:08,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:20:09,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:20:09,102 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:20:09,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:20:09,240 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:20:09,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09 WrapperNode [2019-12-18 21:20:09,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:20:09,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:20:09,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:20:09,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:20:09,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (1/1) ... [2019-12-18 21:20:09,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (1/1) ... [2019-12-18 21:20:09,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:20:09,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:20:09,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:20:09,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:20:09,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (1/1) ... [2019-12-18 21:20:09,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (1/1) ... [2019-12-18 21:20:09,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (1/1) ... [2019-12-18 21:20:09,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (1/1) ... [2019-12-18 21:20:09,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (1/1) ... [2019-12-18 21:20:09,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (1/1) ... [2019-12-18 21:20:09,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (1/1) ... [2019-12-18 21:20:09,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:20:09,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:20:09,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:20:09,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:20:09,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:20:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:20:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:20:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:20:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:20:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:20:09,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:20:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:20:09,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:20:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:20:09,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:20:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:20:09,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:20:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:20:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:20:09,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:20:09,418 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:20:10,132 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:20:10,133 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:20:10,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:20:10 BoogieIcfgContainer [2019-12-18 21:20:10,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:20:10,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:20:10,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:20:10,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:20:10,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:20:08" (1/3) ... [2019-12-18 21:20:10,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fff101b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:20:10, skipping insertion in model container [2019-12-18 21:20:10,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:20:09" (2/3) ... [2019-12-18 21:20:10,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fff101b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:20:10, skipping insertion in model container [2019-12-18 21:20:10,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:20:10" (3/3) ... [2019-12-18 21:20:10,143 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_tso.opt.i [2019-12-18 21:20:10,154 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:20:10,154 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:20:10,163 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:20:10,164 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:20:10,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,215 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,216 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,255 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,255 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,256 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,256 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,256 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,256 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,256 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,257 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,257 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,257 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,258 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,259 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,259 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,259 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,259 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,260 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,260 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,260 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,260 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,262 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,262 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,262 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,263 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,263 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,263 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,263 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,263 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,264 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,264 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,264 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,264 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,265 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,265 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,266 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,292 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,294 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,302 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,302 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,303 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,307 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:20:10,322 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:20:10,344 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:20:10,344 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:20:10,345 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:20:10,345 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:20:10,345 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:20:10,345 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:20:10,345 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:20:10,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:20:10,368 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-18 21:20:10,370 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 21:20:10,453 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 21:20:10,453 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:20:10,473 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:20:10,494 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 21:20:10,587 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 21:20:10,587 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:20:10,594 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:20:10,611 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 21:20:10,613 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:20:14,541 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 21:20:14,736 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 21:20:14,755 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45931 [2019-12-18 21:20:14,756 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-18 21:20:14,759 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 79 transitions [2019-12-18 21:20:15,977 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22190 states. [2019-12-18 21:20:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 22190 states. [2019-12-18 21:20:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:20:15,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:15,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:15,987 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:15,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:15,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1275249875, now seen corresponding path program 1 times [2019-12-18 21:20:15,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:15,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435565147] [2019-12-18 21:20:15,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:16,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435565147] [2019-12-18 21:20:16,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:16,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:20:16,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235447635] [2019-12-18 21:20:16,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:20:16,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:16,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:20:16,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:16,293 INFO L87 Difference]: Start difference. First operand 22190 states. Second operand 3 states. [2019-12-18 21:20:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:16,957 INFO L93 Difference]: Finished difference Result 21750 states and 93576 transitions. [2019-12-18 21:20:16,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:20:16,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:20:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:17,226 INFO L225 Difference]: With dead ends: 21750 [2019-12-18 21:20:17,228 INFO L226 Difference]: Without dead ends: 20406 [2019-12-18 21:20:17,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20406 states. [2019-12-18 21:20:18,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20406 to 20406. [2019-12-18 21:20:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-18 21:20:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 87656 transitions. [2019-12-18 21:20:19,318 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 87656 transitions. Word has length 9 [2019-12-18 21:20:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:19,320 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 87656 transitions. [2019-12-18 21:20:19,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:20:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 87656 transitions. [2019-12-18 21:20:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:20:19,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:19,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:19,334 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1986305756, now seen corresponding path program 1 times [2019-12-18 21:20:19,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:19,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516262246] [2019-12-18 21:20:19,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:19,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516262246] [2019-12-18 21:20:19,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:19,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:20:19,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484084769] [2019-12-18 21:20:19,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:20:19,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:20:19,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:20:19,495 INFO L87 Difference]: Start difference. First operand 20406 states and 87656 transitions. Second operand 4 states. [2019-12-18 21:20:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:20,270 INFO L93 Difference]: Finished difference Result 31694 states and 131120 transitions. [2019-12-18 21:20:20,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:20:20,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:20:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:20,431 INFO L225 Difference]: With dead ends: 31694 [2019-12-18 21:20:20,431 INFO L226 Difference]: Without dead ends: 31634 [2019-12-18 21:20:20,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:20:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31634 states. [2019-12-18 21:20:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31634 to 28582. [2019-12-18 21:20:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28582 states. [2019-12-18 21:20:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28582 states to 28582 states and 119644 transitions. [2019-12-18 21:20:22,879 INFO L78 Accepts]: Start accepts. Automaton has 28582 states and 119644 transitions. Word has length 15 [2019-12-18 21:20:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:22,880 INFO L462 AbstractCegarLoop]: Abstraction has 28582 states and 119644 transitions. [2019-12-18 21:20:22,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:20:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 28582 states and 119644 transitions. [2019-12-18 21:20:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:20:22,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:22,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:22,887 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:22,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:22,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2051676058, now seen corresponding path program 1 times [2019-12-18 21:20:22,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:22,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829078696] [2019-12-18 21:20:22,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:23,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829078696] [2019-12-18 21:20:23,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:23,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:20:23,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466792454] [2019-12-18 21:20:23,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:20:23,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:23,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:20:23,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:20:23,007 INFO L87 Difference]: Start difference. First operand 28582 states and 119644 transitions. Second operand 4 states. [2019-12-18 21:20:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:23,352 INFO L93 Difference]: Finished difference Result 35982 states and 149300 transitions. [2019-12-18 21:20:23,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:20:23,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 21:20:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:23,942 INFO L225 Difference]: With dead ends: 35982 [2019-12-18 21:20:23,942 INFO L226 Difference]: Without dead ends: 35934 [2019-12-18 21:20:23,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:20:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35934 states. [2019-12-18 21:20:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35934 to 31130. [2019-12-18 21:20:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31130 states. [2019-12-18 21:20:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31130 states to 31130 states and 130164 transitions. [2019-12-18 21:20:25,343 INFO L78 Accepts]: Start accepts. Automaton has 31130 states and 130164 transitions. Word has length 18 [2019-12-18 21:20:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:25,343 INFO L462 AbstractCegarLoop]: Abstraction has 31130 states and 130164 transitions. [2019-12-18 21:20:25,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:20:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 31130 states and 130164 transitions. [2019-12-18 21:20:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 21:20:25,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:25,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:25,354 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash 94366494, now seen corresponding path program 1 times [2019-12-18 21:20:25,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:25,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566384338] [2019-12-18 21:20:25,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:25,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566384338] [2019-12-18 21:20:25,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:25,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:20:25,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758840471] [2019-12-18 21:20:25,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:20:25,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:25,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:20:25,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:25,424 INFO L87 Difference]: Start difference. First operand 31130 states and 130164 transitions. Second operand 3 states. [2019-12-18 21:20:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:25,565 INFO L93 Difference]: Finished difference Result 30694 states and 128328 transitions. [2019-12-18 21:20:25,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:20:25,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 21:20:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:27,186 INFO L225 Difference]: With dead ends: 30694 [2019-12-18 21:20:27,186 INFO L226 Difference]: Without dead ends: 30694 [2019-12-18 21:20:27,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30694 states. [2019-12-18 21:20:27,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30694 to 30694. [2019-12-18 21:20:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30694 states. [2019-12-18 21:20:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30694 states to 30694 states and 128328 transitions. [2019-12-18 21:20:28,084 INFO L78 Accepts]: Start accepts. Automaton has 30694 states and 128328 transitions. Word has length 20 [2019-12-18 21:20:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:28,084 INFO L462 AbstractCegarLoop]: Abstraction has 30694 states and 128328 transitions. [2019-12-18 21:20:28,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:20:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 30694 states and 128328 transitions. [2019-12-18 21:20:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:20:28,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:28,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:28,101 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:28,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash 831760779, now seen corresponding path program 1 times [2019-12-18 21:20:28,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:28,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510666964] [2019-12-18 21:20:28,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:28,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510666964] [2019-12-18 21:20:28,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:28,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:20:28,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816649931] [2019-12-18 21:20:28,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:20:28,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:20:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:28,149 INFO L87 Difference]: Start difference. First operand 30694 states and 128328 transitions. Second operand 3 states. [2019-12-18 21:20:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:28,330 INFO L93 Difference]: Finished difference Result 30650 states and 128132 transitions. [2019-12-18 21:20:28,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:20:28,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 21:20:28,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:28,724 INFO L225 Difference]: With dead ends: 30650 [2019-12-18 21:20:28,725 INFO L226 Difference]: Without dead ends: 30650 [2019-12-18 21:20:28,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:28,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30650 states. [2019-12-18 21:20:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30650 to 30650. [2019-12-18 21:20:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30650 states. [2019-12-18 21:20:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30650 states to 30650 states and 128132 transitions. [2019-12-18 21:20:31,096 INFO L78 Accepts]: Start accepts. Automaton has 30650 states and 128132 transitions. Word has length 21 [2019-12-18 21:20:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:31,096 INFO L462 AbstractCegarLoop]: Abstraction has 30650 states and 128132 transitions. [2019-12-18 21:20:31,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:20:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 30650 states and 128132 transitions. [2019-12-18 21:20:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:20:31,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:31,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:31,110 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:31,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:31,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1462742231, now seen corresponding path program 1 times [2019-12-18 21:20:31,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:31,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076004064] [2019-12-18 21:20:31,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:31,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076004064] [2019-12-18 21:20:31,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:31,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:20:31,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429045551] [2019-12-18 21:20:31,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:20:31,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:20:31,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:31,161 INFO L87 Difference]: Start difference. First operand 30650 states and 128132 transitions. Second operand 3 states. [2019-12-18 21:20:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:31,423 INFO L93 Difference]: Finished difference Result 45416 states and 181621 transitions. [2019-12-18 21:20:31,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:20:31,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-18 21:20:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:31,500 INFO L225 Difference]: With dead ends: 45416 [2019-12-18 21:20:31,500 INFO L226 Difference]: Without dead ends: 32472 [2019-12-18 21:20:31,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32472 states. [2019-12-18 21:20:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32472 to 31184. [2019-12-18 21:20:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31184 states. [2019-12-18 21:20:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31184 states to 31184 states and 116749 transitions. [2019-12-18 21:20:32,392 INFO L78 Accepts]: Start accepts. Automaton has 31184 states and 116749 transitions. Word has length 22 [2019-12-18 21:20:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:32,392 INFO L462 AbstractCegarLoop]: Abstraction has 31184 states and 116749 transitions. [2019-12-18 21:20:32,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:20:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 31184 states and 116749 transitions. [2019-12-18 21:20:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:20:32,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:32,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:32,408 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:32,408 INFO L82 PathProgramCache]: Analyzing trace with hash 469546711, now seen corresponding path program 1 times [2019-12-18 21:20:32,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:32,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381640859] [2019-12-18 21:20:32,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:32,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381640859] [2019-12-18 21:20:32,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:32,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:20:32,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134120299] [2019-12-18 21:20:32,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:20:32,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:32,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:20:32,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:32,521 INFO L87 Difference]: Start difference. First operand 31184 states and 116749 transitions. Second operand 3 states. [2019-12-18 21:20:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:33,132 INFO L93 Difference]: Finished difference Result 31184 states and 115357 transitions. [2019-12-18 21:20:33,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:20:33,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-18 21:20:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:33,226 INFO L225 Difference]: With dead ends: 31184 [2019-12-18 21:20:33,226 INFO L226 Difference]: Without dead ends: 31184 [2019-12-18 21:20:33,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31184 states. [2019-12-18 21:20:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31184 to 30784. [2019-12-18 21:20:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30784 states. [2019-12-18 21:20:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30784 states to 30784 states and 113997 transitions. [2019-12-18 21:20:35,624 INFO L78 Accepts]: Start accepts. Automaton has 30784 states and 113997 transitions. Word has length 22 [2019-12-18 21:20:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:35,625 INFO L462 AbstractCegarLoop]: Abstraction has 30784 states and 113997 transitions. [2019-12-18 21:20:35,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:20:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 30784 states and 113997 transitions. [2019-12-18 21:20:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 21:20:35,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:35,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:35,638 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:35,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:35,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1201021632, now seen corresponding path program 1 times [2019-12-18 21:20:35,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:35,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388468564] [2019-12-18 21:20:35,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:35,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388468564] [2019-12-18 21:20:35,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:35,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:20:35,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903246222] [2019-12-18 21:20:35,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:20:35,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:35,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:20:35,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:20:35,736 INFO L87 Difference]: Start difference. First operand 30784 states and 113997 transitions. Second operand 4 states. [2019-12-18 21:20:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:35,881 INFO L93 Difference]: Finished difference Result 26303 states and 91404 transitions. [2019-12-18 21:20:35,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:20:35,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 21:20:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:35,927 INFO L225 Difference]: With dead ends: 26303 [2019-12-18 21:20:35,927 INFO L226 Difference]: Without dead ends: 24465 [2019-12-18 21:20:35,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:20:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24465 states. [2019-12-18 21:20:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24465 to 24465. [2019-12-18 21:20:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24465 states. [2019-12-18 21:20:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24465 states to 24465 states and 85880 transitions. [2019-12-18 21:20:36,341 INFO L78 Accepts]: Start accepts. Automaton has 24465 states and 85880 transitions. Word has length 23 [2019-12-18 21:20:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:36,342 INFO L462 AbstractCegarLoop]: Abstraction has 24465 states and 85880 transitions. [2019-12-18 21:20:36,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:20:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 24465 states and 85880 transitions. [2019-12-18 21:20:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 21:20:36,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:36,351 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 21:20:36,351 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:36,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1983808268, now seen corresponding path program 1 times [2019-12-18 21:20:36,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:36,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318006247] [2019-12-18 21:20:36,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:36,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318006247] [2019-12-18 21:20:36,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:36,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:20:36,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999221278] [2019-12-18 21:20:36,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:20:36,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:36,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:20:36,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:20:36,427 INFO L87 Difference]: Start difference. First operand 24465 states and 85880 transitions. Second operand 5 states. [2019-12-18 21:20:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:36,554 INFO L93 Difference]: Finished difference Result 12353 states and 38253 transitions. [2019-12-18 21:20:36,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:20:36,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 21:20:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:36,579 INFO L225 Difference]: With dead ends: 12353 [2019-12-18 21:20:36,579 INFO L226 Difference]: Without dead ends: 10902 [2019-12-18 21:20:36,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:20:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-12-18 21:20:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-12-18 21:20:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-12-18 21:20:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 33618 transitions. [2019-12-18 21:20:36,932 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 33618 transitions. Word has length 24 [2019-12-18 21:20:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:36,932 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 33618 transitions. [2019-12-18 21:20:36,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:20:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 33618 transitions. [2019-12-18 21:20:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:20:36,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:36,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:36,938 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:36,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:36,938 INFO L82 PathProgramCache]: Analyzing trace with hash 22545008, now seen corresponding path program 1 times [2019-12-18 21:20:36,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:36,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617877406] [2019-12-18 21:20:36,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:36,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617877406] [2019-12-18 21:20:36,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:36,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:20:36,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150023402] [2019-12-18 21:20:36,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:20:36,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:36,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:20:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:20:36,990 INFO L87 Difference]: Start difference. First operand 10902 states and 33618 transitions. Second operand 4 states. [2019-12-18 21:20:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:37,079 INFO L93 Difference]: Finished difference Result 16450 states and 50656 transitions. [2019-12-18 21:20:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:20:37,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:20:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:37,100 INFO L225 Difference]: With dead ends: 16450 [2019-12-18 21:20:37,100 INFO L226 Difference]: Without dead ends: 8773 [2019-12-18 21:20:37,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:20:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-18 21:20:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 8484. [2019-12-18 21:20:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8484 states. [2019-12-18 21:20:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 26171 transitions. [2019-12-18 21:20:37,261 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 26171 transitions. Word has length 25 [2019-12-18 21:20:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:37,261 INFO L462 AbstractCegarLoop]: Abstraction has 8484 states and 26171 transitions. [2019-12-18 21:20:37,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:20:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 26171 transitions. [2019-12-18 21:20:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:20:37,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:37,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:37,266 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:37,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:37,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1039706542, now seen corresponding path program 2 times [2019-12-18 21:20:37,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:37,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436823486] [2019-12-18 21:20:37,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:37,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436823486] [2019-12-18 21:20:37,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:37,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:20:37,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674115370] [2019-12-18 21:20:37,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:20:37,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:20:37,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:20:37,306 INFO L87 Difference]: Start difference. First operand 8484 states and 26171 transitions. Second operand 4 states. [2019-12-18 21:20:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:37,374 INFO L93 Difference]: Finished difference Result 12593 states and 38979 transitions. [2019-12-18 21:20:37,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:20:37,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:20:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:37,390 INFO L225 Difference]: With dead ends: 12593 [2019-12-18 21:20:37,390 INFO L226 Difference]: Without dead ends: 7913 [2019-12-18 21:20:37,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:20:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states. [2019-12-18 21:20:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 7425. [2019-12-18 21:20:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7425 states. [2019-12-18 21:20:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 21851 transitions. [2019-12-18 21:20:37,516 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 21851 transitions. Word has length 25 [2019-12-18 21:20:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:37,516 INFO L462 AbstractCegarLoop]: Abstraction has 7425 states and 21851 transitions. [2019-12-18 21:20:37,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:20:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 21851 transitions. [2019-12-18 21:20:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:20:37,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:37,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:37,521 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:37,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1222398540, now seen corresponding path program 3 times [2019-12-18 21:20:37,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:37,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95501794] [2019-12-18 21:20:37,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:37,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95501794] [2019-12-18 21:20:37,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:37,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:20:37,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055062487] [2019-12-18 21:20:37,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:20:37,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:37,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:20:37,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:20:37,601 INFO L87 Difference]: Start difference. First operand 7425 states and 21851 transitions. Second operand 6 states. [2019-12-18 21:20:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:37,705 INFO L93 Difference]: Finished difference Result 2984 states and 7748 transitions. [2019-12-18 21:20:37,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:20:37,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 21:20:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:37,712 INFO L225 Difference]: With dead ends: 2984 [2019-12-18 21:20:37,712 INFO L226 Difference]: Without dead ends: 2530 [2019-12-18 21:20:37,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:20:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-12-18 21:20:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2530. [2019-12-18 21:20:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2530 states. [2019-12-18 21:20:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 6428 transitions. [2019-12-18 21:20:37,751 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 6428 transitions. Word has length 25 [2019-12-18 21:20:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:37,751 INFO L462 AbstractCegarLoop]: Abstraction has 2530 states and 6428 transitions. [2019-12-18 21:20:37,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:20:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 6428 transitions. [2019-12-18 21:20:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:20:37,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:37,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:37,757 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:37,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:37,757 INFO L82 PathProgramCache]: Analyzing trace with hash 923857396, now seen corresponding path program 1 times [2019-12-18 21:20:37,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:37,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615658914] [2019-12-18 21:20:37,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:37,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615658914] [2019-12-18 21:20:37,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:37,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:20:37,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965452985] [2019-12-18 21:20:37,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:20:37,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:37,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:20:37,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:37,806 INFO L87 Difference]: Start difference. First operand 2530 states and 6428 transitions. Second operand 3 states. [2019-12-18 21:20:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:37,862 INFO L93 Difference]: Finished difference Result 3810 states and 9643 transitions. [2019-12-18 21:20:37,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:20:37,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 21:20:37,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:37,868 INFO L225 Difference]: With dead ends: 3810 [2019-12-18 21:20:37,868 INFO L226 Difference]: Without dead ends: 3810 [2019-12-18 21:20:37,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:20:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2019-12-18 21:20:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 2986. [2019-12-18 21:20:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2019-12-18 21:20:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 7669 transitions. [2019-12-18 21:20:37,930 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 7669 transitions. Word has length 32 [2019-12-18 21:20:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:37,930 INFO L462 AbstractCegarLoop]: Abstraction has 2986 states and 7669 transitions. [2019-12-18 21:20:37,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:20:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 7669 transitions. [2019-12-18 21:20:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:20:37,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:37,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:37,936 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash 386347120, now seen corresponding path program 1 times [2019-12-18 21:20:37,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:37,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112777678] [2019-12-18 21:20:37,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:38,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112777678] [2019-12-18 21:20:38,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:38,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:20:38,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528503005] [2019-12-18 21:20:38,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:20:38,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:38,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:20:38,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:20:38,054 INFO L87 Difference]: Start difference. First operand 2986 states and 7669 transitions. Second operand 7 states. [2019-12-18 21:20:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:38,174 INFO L93 Difference]: Finished difference Result 2326 states and 6084 transitions. [2019-12-18 21:20:38,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:20:38,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 21:20:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:38,176 INFO L225 Difference]: With dead ends: 2326 [2019-12-18 21:20:38,176 INFO L226 Difference]: Without dead ends: 441 [2019-12-18 21:20:38,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:20:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-12-18 21:20:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-12-18 21:20:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-12-18 21:20:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1003 transitions. [2019-12-18 21:20:38,183 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1003 transitions. Word has length 32 [2019-12-18 21:20:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:38,184 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 1003 transitions. [2019-12-18 21:20:38,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:20:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1003 transitions. [2019-12-18 21:20:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 21:20:38,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:38,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:38,185 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1659981285, now seen corresponding path program 1 times [2019-12-18 21:20:38,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:38,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030888927] [2019-12-18 21:20:38,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:20:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:20:38,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030888927] [2019-12-18 21:20:38,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:20:38,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:20:38,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039387751] [2019-12-18 21:20:38,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:20:38,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:20:38,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:20:38,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:20:38,277 INFO L87 Difference]: Start difference. First operand 441 states and 1003 transitions. Second operand 7 states. [2019-12-18 21:20:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:20:38,481 INFO L93 Difference]: Finished difference Result 842 states and 1868 transitions. [2019-12-18 21:20:38,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:20:38,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 21:20:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:20:38,482 INFO L225 Difference]: With dead ends: 842 [2019-12-18 21:20:38,483 INFO L226 Difference]: Without dead ends: 564 [2019-12-18 21:20:38,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:20:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-18 21:20:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 506. [2019-12-18 21:20:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-12-18 21:20:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1115 transitions. [2019-12-18 21:20:38,490 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1115 transitions. Word has length 48 [2019-12-18 21:20:38,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:20:38,491 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 1115 transitions. [2019-12-18 21:20:38,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:20:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1115 transitions. [2019-12-18 21:20:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 21:20:38,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:20:38,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:20:38,492 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:20:38,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:20:38,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1305532347, now seen corresponding path program 2 times [2019-12-18 21:20:38,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:20:38,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516435572] [2019-12-18 21:20:38,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:20:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:20:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:20:38,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:20:38,625 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:20:38,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= v_~b~0_13 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1053~0.base_29| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1053~0.base_29|) |v_ULTIMATE.start_main_~#t1053~0.offset_22| 0)) |v_#memory_int_25|) (= 0 v_~z$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_25) (= v_~z$w_buff0_used~0_92 0) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~z$r_buff0_thd1~0_10 0) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y~0_17 0) (= v_~main$tmp_guard0~0_12 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1053~0.base_29|) (= 0 v_~z$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_29|) 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1053~0.base_29| 4)) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~z$read_delayed~0_6 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_29| 1)) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$w_buff0~0_24) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 v_~z$w_buff1_used~0_61) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_66 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~z$r_buff1_thd3~0_43) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x~0_12 0) (= v_~z~0_20 0) (= v_~z$r_buff0_thd0~0_23 0) (= 0 |v_ULTIMATE.start_main_~#t1053~0.offset_22|) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1053~0.offset=|v_ULTIMATE.start_main_~#t1053~0.offset_22|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ULTIMATE.start_main_~#t1053~0.base=|v_ULTIMATE.start_main_~#t1053~0.base_29|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_15|, ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_12, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ~b~0=v_~b~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_20, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_23|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1053~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1053~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1055~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1056~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1054~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1055~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1054~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:20:38,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1054~0.base_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1054~0.base_11| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1054~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1054~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11|) |v_ULTIMATE.start_main_~#t1054~0.offset_10| 1)) |v_#memory_int_19|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1054~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1054~0.base] because there is no mapped edge [2019-12-18 21:20:38,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1055~0.base_12|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12|) |v_ULTIMATE.start_main_~#t1055~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t1055~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1055~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1055~0.base_12| 0)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1055~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1055~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 21:20:38,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1056~0.offset_10|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1056~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1056~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12|) |v_ULTIMATE.start_main_~#t1056~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1056~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_10|, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1056~0.base] because there is no mapped edge [2019-12-18 21:20:38,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L4-->L820: Formula: (and (= ~__unbuffered_p3_EBX~0_Out-773065024 ~b~0_In-773065024) (= ~z$r_buff0_thd4~0_In-773065024 ~z$r_buff1_thd4~0_Out-773065024) (= ~z$r_buff1_thd2~0_Out-773065024 ~z$r_buff0_thd2~0_In-773065024) (= ~z$r_buff0_thd1~0_In-773065024 ~z$r_buff1_thd1~0_Out-773065024) (= ~a~0_Out-773065024 1) (= ~z$r_buff1_thd0~0_Out-773065024 ~z$r_buff0_thd0~0_In-773065024) (= ~z$r_buff0_thd4~0_Out-773065024 1) (= ~a~0_Out-773065024 ~__unbuffered_p3_EAX~0_Out-773065024) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-773065024)) (= ~z$r_buff1_thd3~0_Out-773065024 ~z$r_buff0_thd3~0_In-773065024)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-773065024, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-773065024, ~b~0=~b~0_In-773065024, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-773065024, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-773065024, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-773065024, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-773065024} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-773065024, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-773065024, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-773065024, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-773065024, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-773065024, ~a~0=~a~0_Out-773065024, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-773065024, ~b~0=~b~0_In-773065024, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-773065024, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-773065024, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-773065024, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-773065024, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-773065024, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-773065024, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-773065024} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 21:20:38,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= 1 v_~b~0_8) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_8) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~b~0=v_~b~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-18 21:20:38,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 1 v_~x~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 1 v_~y~0_8) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_8, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 21:20:38,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L778-->L778-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-780670132 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-780670132 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-780670132 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-780670132 256)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-780670132 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite8_Out-780670132| |P2Thread1of1ForFork1_#t~ite9_Out-780670132|) (= |P2Thread1of1ForFork1_#t~ite8_Out-780670132| ~z$w_buff0~0_In-780670132) .cse1) (and (not .cse1) (= ~z$w_buff0~0_In-780670132 |P2Thread1of1ForFork1_#t~ite9_Out-780670132|) (= |P2Thread1of1ForFork1_#t~ite8_In-780670132| |P2Thread1of1ForFork1_#t~ite8_Out-780670132|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-780670132, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-780670132, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-780670132, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-780670132, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-780670132, ~weak$$choice2~0=~weak$$choice2~0_In-780670132, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-780670132|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-780670132, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-780670132, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-780670132, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-780670132, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-780670132, ~weak$$choice2~0=~weak$$choice2~0_In-780670132, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-780670132|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-780670132|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:20:38,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1243856399 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite11_In1243856399| |P2Thread1of1ForFork1_#t~ite11_Out1243856399|) (= |P2Thread1of1ForFork1_#t~ite12_Out1243856399| ~z$w_buff1~0_In1243856399)) (and (= |P2Thread1of1ForFork1_#t~ite11_Out1243856399| ~z$w_buff1~0_In1243856399) (= |P2Thread1of1ForFork1_#t~ite11_Out1243856399| |P2Thread1of1ForFork1_#t~ite12_Out1243856399|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1243856399 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In1243856399 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In1243856399 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In1243856399 256) 0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1243856399, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1243856399, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1243856399|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1243856399, ~z$w_buff1~0=~z$w_buff1~0_In1243856399, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1243856399, ~weak$$choice2~0=~weak$$choice2~0_In1243856399} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1243856399, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1243856399|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1243856399, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1243856399|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1243856399, ~z$w_buff1~0=~z$w_buff1~0_In1243856399, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1243856399, ~weak$$choice2~0=~weak$$choice2~0_In1243856399} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:20:38,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1417630485 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In1417630485| |P2Thread1of1ForFork1_#t~ite14_Out1417630485|) (= |P2Thread1of1ForFork1_#t~ite15_Out1417630485| ~z$w_buff0_used~0_In1417630485)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out1417630485| ~z$w_buff0_used~0_In1417630485) (= |P2Thread1of1ForFork1_#t~ite15_Out1417630485| |P2Thread1of1ForFork1_#t~ite14_Out1417630485|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1417630485 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1417630485 256)) (and (= (mod ~z$r_buff1_thd3~0_In1417630485 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In1417630485 256)) .cse1)))))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1417630485|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1417630485, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1417630485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1417630485, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1417630485, ~weak$$choice2~0=~weak$$choice2~0_In1417630485} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1417630485|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1417630485|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1417630485, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1417630485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1417630485, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1417630485, ~weak$$choice2~0=~weak$$choice2~0_In1417630485} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-18 21:20:38,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 21:20:38,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1982819849 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In1982819849| |P2Thread1of1ForFork1_#t~ite23_Out1982819849|) (= |P2Thread1of1ForFork1_#t~ite24_Out1982819849| ~z$r_buff1_thd3~0_In1982819849)) (and (= |P2Thread1of1ForFork1_#t~ite23_Out1982819849| ~z$r_buff1_thd3~0_In1982819849) .cse0 (= |P2Thread1of1ForFork1_#t~ite23_Out1982819849| |P2Thread1of1ForFork1_#t~ite24_Out1982819849|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1982819849 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1982819849 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1982819849 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1982819849 256)))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1982819849, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1982819849, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In1982819849|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1982819849, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1982819849, ~weak$$choice2~0=~weak$$choice2~0_In1982819849} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out1982819849|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1982819849, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1982819849, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out1982819849|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1982819849, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1982819849, ~weak$$choice2~0=~weak$$choice2~0_In1982819849} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-18 21:20:38,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_13 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:20:38,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In501932697 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In501932697 256)))) (or (and (= ~z$w_buff0_used~0_In501932697 |P3Thread1of1ForFork2_#t~ite28_Out501932697|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out501932697|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In501932697, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In501932697} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out501932697|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In501932697, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In501932697} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 21:20:38,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1917666822 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1917666822 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1917666822 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1917666822 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite29_Out1917666822| ~z$w_buff1_used~0_In1917666822) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite29_Out1917666822| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1917666822, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1917666822, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1917666822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1917666822} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1917666822|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1917666822, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1917666822, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1917666822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1917666822} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 21:20:38,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In260420310 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In260420310 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out260420310 ~z$r_buff0_thd4~0_In260420310)) (and (= 0 ~z$r_buff0_thd4~0_Out260420310) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In260420310, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In260420310} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In260420310, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out260420310, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out260420310|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-18 21:20:38,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1349656108 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1349656108 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1349656108 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1349656108 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out-1349656108| ~z$r_buff1_thd4~0_In-1349656108) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out-1349656108| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1349656108, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1349656108, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1349656108, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1349656108} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1349656108, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1349656108, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1349656108, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1349656108, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1349656108|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 21:20:38,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_16) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 21:20:38,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_63 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:20:38,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-450547953| |ULTIMATE.start_main_#t~ite36_Out-450547953|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-450547953 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-450547953 256) 0))) (or (and (= ~z~0_In-450547953 |ULTIMATE.start_main_#t~ite36_Out-450547953|) (or .cse0 .cse1) .cse2) (and .cse2 (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-450547953 |ULTIMATE.start_main_#t~ite36_Out-450547953|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-450547953, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-450547953, ~z$w_buff1~0=~z$w_buff1~0_In-450547953, ~z~0=~z~0_In-450547953} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-450547953, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-450547953, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-450547953|, ~z$w_buff1~0=~z$w_buff1~0_In-450547953, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-450547953|, ~z~0=~z~0_In-450547953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:20:38,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1611090483 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1611090483 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1611090483| ~z$w_buff0_used~0_In1611090483) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1611090483| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1611090483, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1611090483} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1611090483, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1611090483, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1611090483|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:20:38,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1426683124 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1426683124 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1426683124 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1426683124 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-1426683124| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out-1426683124| ~z$w_buff1_used~0_In-1426683124)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1426683124, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426683124, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1426683124, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426683124} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1426683124, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1426683124|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426683124, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1426683124, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426683124} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:20:38,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-962255535 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-962255535 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-962255535| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-962255535| ~z$r_buff0_thd0~0_In-962255535)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-962255535, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-962255535} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-962255535, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-962255535|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-962255535} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:20:38,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In627458239 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In627458239 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In627458239 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In627458239 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out627458239| 0)) (and (= |ULTIMATE.start_main_#t~ite41_Out627458239| ~z$r_buff1_thd0~0_In627458239) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In627458239, ~z$w_buff0_used~0=~z$w_buff0_used~0_In627458239, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In627458239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In627458239} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out627458239|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In627458239, ~z$w_buff0_used~0=~z$w_buff0_used~0_In627458239, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In627458239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In627458239} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 21:20:38,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= 1 v_~__unbuffered_p3_EAX~0_10)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:20:38,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:20:38 BasicIcfg [2019-12-18 21:20:38,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:20:38,753 INFO L168 Benchmark]: Toolchain (without parser) took 30318.26 ms. Allocated memory was 144.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 100.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 388.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:20:38,753 INFO L168 Benchmark]: CDTParser took 1.37 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:20:38,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.49 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:20:38,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:20:38,756 INFO L168 Benchmark]: Boogie Preprocessor took 41.42 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:20:38,756 INFO L168 Benchmark]: RCFGBuilder took 786.91 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 105.0 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:20:38,757 INFO L168 Benchmark]: TraceAbstraction took 28615.17 ms. Allocated memory was 202.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 104.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 334.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:20:38,761 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.37 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.49 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.42 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.91 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 105.0 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28615.17 ms. Allocated memory was 202.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 104.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 334.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 170 ProgramPointsBefore, 75 ProgramPointsAfterwards, 192 TransitionsBefore, 79 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 23 ChoiceCompositions, 5608 VarBasedMoverChecksPositive, 130 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 45931 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1053, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1054, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1055, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1056, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1541 SDtfs, 2115 SDslu, 2332 SDs, 0 SdLazy, 525 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31184occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 11203 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 25998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...