/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/mix000_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:54:27,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:54:27,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:54:27,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:54:27,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:54:27,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:54:27,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:54:27,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:54:27,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:54:27,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:54:27,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:54:27,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:54:27,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:54:27,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:54:27,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:54:27,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:54:27,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:54:27,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:54:27,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:54:27,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:54:27,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:54:27,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:54:27,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:54:27,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:54:27,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:54:27,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:54:27,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:54:27,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:54:27,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:54:27,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:54:27,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:54:27,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:54:27,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:54:27,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:54:27,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:54:27,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:54:27,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:54:27,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:54:27,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:54:27,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:54:27,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:54:27,203 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 19:54:27,223 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:54:27,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:54:27,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:54:27,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:54:27,227 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:54:27,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:54:27,227 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:54:27,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:54:27,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:54:27,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:54:27,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:54:27,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:54:27,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:54:27,230 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:54:27,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:54:27,230 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:54:27,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:54:27,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:54:27,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:54:27,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:54:27,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:54:27,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:54:27,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:54:27,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:54:27,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:54:27,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:54:27,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:54:27,233 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 19:54:27,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:54:27,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:54:27,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:54:27,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:54:27,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:54:27,518 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:54:27,519 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:54:27,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.opt.i [2019-12-18 19:54:27,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ffbd973/5e17331f2e8a4a7ab4e7714336882abe/FLAG99102c5c2 [2019-12-18 19:54:28,162 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:54:28,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_rmo.opt.i [2019-12-18 19:54:28,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ffbd973/5e17331f2e8a4a7ab4e7714336882abe/FLAG99102c5c2 [2019-12-18 19:54:28,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ffbd973/5e17331f2e8a4a7ab4e7714336882abe [2019-12-18 19:54:28,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:54:28,432 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:54:28,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:54:28,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:54:28,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:54:28,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:54:28" (1/1) ... [2019-12-18 19:54:28,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604e4d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:28, skipping insertion in model container [2019-12-18 19:54:28,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:54:28" (1/1) ... [2019-12-18 19:54:28,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:54:28,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:54:28,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:54:29,012 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:54:29,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:54:29,166 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:54:29,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29 WrapperNode [2019-12-18 19:54:29,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:54:29,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:54:29,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:54:29,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:54:29,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (1/1) ... [2019-12-18 19:54:29,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (1/1) ... [2019-12-18 19:54:29,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:54:29,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:54:29,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:54:29,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:54:29,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (1/1) ... [2019-12-18 19:54:29,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (1/1) ... [2019-12-18 19:54:29,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (1/1) ... [2019-12-18 19:54:29,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (1/1) ... [2019-12-18 19:54:29,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (1/1) ... [2019-12-18 19:54:29,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (1/1) ... [2019-12-18 19:54:29,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (1/1) ... [2019-12-18 19:54:29,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:54:29,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:54:29,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:54:29,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:54:29,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:54:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:54:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:54:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:54:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:54:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:54:29,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:54:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:54:29,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:54:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:54:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:54:29,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:54:29,367 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 19:54:30,207 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:54:30,207 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:54:30,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:54:30 BoogieIcfgContainer [2019-12-18 19:54:30,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:54:30,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:54:30,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:54:30,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:54:30,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:54:28" (1/3) ... [2019-12-18 19:54:30,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e06c895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:54:30, skipping insertion in model container [2019-12-18 19:54:30,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:29" (2/3) ... [2019-12-18 19:54:30,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e06c895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:54:30, skipping insertion in model container [2019-12-18 19:54:30,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:54:30" (3/3) ... [2019-12-18 19:54:30,222 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_rmo.opt.i [2019-12-18 19:54:30,233 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:54:30,234 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:54:30,248 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:54:30,249 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:54:30,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,328 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,329 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,349 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,349 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,350 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,350 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,350 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,386 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,387 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,390 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:30,406 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 19:54:30,427 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:54:30,427 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:54:30,427 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:54:30,427 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:54:30,427 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:54:30,428 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:54:30,428 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:54:30,428 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:54:30,446 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-18 19:54:30,448 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-18 19:54:30,544 INFO L126 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-18 19:54:30,544 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:54:30,566 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 19:54:30,599 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-18 19:54:30,656 INFO L126 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-18 19:54:30,656 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:54:30,666 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 19:54:30,692 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-18 19:54:30,694 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 19:54:33,961 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 19:54:34,083 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 19:54:34,137 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130993 [2019-12-18 19:54:34,138 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 19:54:34,150 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 132 transitions [2019-12-18 19:54:35,701 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25458 states. [2019-12-18 19:54:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 25458 states. [2019-12-18 19:54:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 19:54:35,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:54:35,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 19:54:35,709 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:54:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:54:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash 956813976, now seen corresponding path program 1 times [2019-12-18 19:54:35,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:54:35,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130383358] [2019-12-18 19:54:35,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:54:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:54:36,006 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 19:54:36,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130383358] [2019-12-18 19:54:36,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:54:36,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:54:36,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246935902] [2019-12-18 19:54:36,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:54:36,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:54:36,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:54:36,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:54:36,031 INFO L87 Difference]: Start difference. First operand 25458 states. Second operand 3 states. [2019-12-18 19:54:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:54:36,508 INFO L93 Difference]: Finished difference Result 25190 states and 90319 transitions. [2019-12-18 19:54:36,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:54:36,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 19:54:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:54:36,744 INFO L225 Difference]: With dead ends: 25190 [2019-12-18 19:54:36,744 INFO L226 Difference]: Without dead ends: 23451 [2019-12-18 19:54:36,746 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 19:54:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23451 states. [2019-12-18 19:54:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23451 to 23451. [2019-12-18 19:54:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23451 states. [2019-12-18 19:54:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23451 states to 23451 states and 84020 transitions. [2019-12-18 19:54:38,968 INFO L78 Accepts]: Start accepts. Automaton has 23451 states and 84020 transitions. Word has length 5 [2019-12-18 19:54:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:54:38,969 INFO L462 AbstractCegarLoop]: Abstraction has 23451 states and 84020 transitions. [2019-12-18 19:54:38,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:54:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 23451 states and 84020 transitions. [2019-12-18 19:54:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:54:38,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:54:38,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:54:38,973 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:54:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:54:38,974 INFO L82 PathProgramCache]: Analyzing trace with hash 962344526, now seen corresponding path program 1 times [2019-12-18 19:54:38,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:54:38,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080135255] [2019-12-18 19:54:38,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:54:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:54:39,113 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 19:54:39,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080135255] [2019-12-18 19:54:39,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:54:39,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:54:39,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259291510] [2019-12-18 19:54:39,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:54:39,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:54:39,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:54:39,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:54:39,116 INFO L87 Difference]: Start difference. First operand 23451 states and 84020 transitions. Second operand 4 states. [2019-12-18 19:54:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:54:40,631 INFO L93 Difference]: Finished difference Result 37210 states and 127163 transitions. [2019-12-18 19:54:40,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:54:40,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:54:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:54:40,792 INFO L225 Difference]: With dead ends: 37210 [2019-12-18 19:54:40,792 INFO L226 Difference]: Without dead ends: 37192 [2019-12-18 19:54:40,793 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 19:54:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37192 states. [2019-12-18 19:54:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37192 to 36211. [2019-12-18 19:54:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36211 states. [2019-12-18 19:54:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36211 states to 36211 states and 124600 transitions. [2019-12-18 19:54:42,329 INFO L78 Accepts]: Start accepts. Automaton has 36211 states and 124600 transitions. Word has length 11 [2019-12-18 19:54:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:54:42,329 INFO L462 AbstractCegarLoop]: Abstraction has 36211 states and 124600 transitions. [2019-12-18 19:54:42,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:54:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 36211 states and 124600 transitions. [2019-12-18 19:54:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:54:42,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:54:42,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:54:42,338 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:54:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:54:42,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1995967631, now seen corresponding path program 1 times [2019-12-18 19:54:42,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:54:42,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244071166] [2019-12-18 19:54:42,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:54:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:54:42,429 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 19:54:42,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244071166] [2019-12-18 19:54:42,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:54:42,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:54:42,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543824379] [2019-12-18 19:54:42,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:54:42,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:54:42,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:54:42,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:54:42,431 INFO L87 Difference]: Start difference. First operand 36211 states and 124600 transitions. Second operand 4 states. [2019-12-18 19:54:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:54:42,908 INFO L93 Difference]: Finished difference Result 46308 states and 156696 transitions. [2019-12-18 19:54:42,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:54:42,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 19:54:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:54:43,032 INFO L225 Difference]: With dead ends: 46308 [2019-12-18 19:54:43,033 INFO L226 Difference]: Without dead ends: 46293 [2019-12-18 19:54:43,033 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 19:54:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46293 states. [2019-12-18 19:54:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46293 to 41467. [2019-12-18 19:54:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41467 states. [2019-12-18 19:54:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41467 states to 41467 states and 141767 transitions. [2019-12-18 19:54:45,918 INFO L78 Accepts]: Start accepts. Automaton has 41467 states and 141767 transitions. Word has length 14 [2019-12-18 19:54:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:54:45,919 INFO L462 AbstractCegarLoop]: Abstraction has 41467 states and 141767 transitions. [2019-12-18 19:54:45,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:54:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 41467 states and 141767 transitions. [2019-12-18 19:54:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:54:45,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:54:45,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:54:45,924 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:54:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:54:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1745483184, now seen corresponding path program 1 times [2019-12-18 19:54:45,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:54:45,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339157290] [2019-12-18 19:54:45,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:54:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:54:45,984 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 19:54:45,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339157290] [2019-12-18 19:54:45,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:54:45,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:54:45,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467069008] [2019-12-18 19:54:45,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:54:45,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:54:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:54:45,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:54:45,987 INFO L87 Difference]: Start difference. First operand 41467 states and 141767 transitions. Second operand 3 states. [2019-12-18 19:54:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:54:46,646 INFO L93 Difference]: Finished difference Result 67426 states and 220619 transitions. [2019-12-18 19:54:46,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:54:46,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 19:54:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:54:46,768 INFO L225 Difference]: With dead ends: 67426 [2019-12-18 19:54:46,769 INFO L226 Difference]: Without dead ends: 67426 [2019-12-18 19:54:46,769 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 19:54:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67426 states. [2019-12-18 19:54:48,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67426 to 60125. [2019-12-18 19:54:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60125 states. [2019-12-18 19:54:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60125 states to 60125 states and 199866 transitions. [2019-12-18 19:54:50,813 INFO L78 Accepts]: Start accepts. Automaton has 60125 states and 199866 transitions. Word has length 15 [2019-12-18 19:54:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:54:50,814 INFO L462 AbstractCegarLoop]: Abstraction has 60125 states and 199866 transitions. [2019-12-18 19:54:50,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:54:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 60125 states and 199866 transitions. [2019-12-18 19:54:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:54:50,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:54:50,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:54:50,819 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:54:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:54:50,820 INFO L82 PathProgramCache]: Analyzing trace with hash -444032019, now seen corresponding path program 1 times [2019-12-18 19:54:50,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:54:50,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329518860] [2019-12-18 19:54:50,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:54:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:54:50,874 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 19:54:50,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329518860] [2019-12-18 19:54:50,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:54:50,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:54:50,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067330538] [2019-12-18 19:54:50,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:54:50,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:54:50,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:54:50,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:54:50,876 INFO L87 Difference]: Start difference. First operand 60125 states and 199866 transitions. Second operand 3 states. [2019-12-18 19:54:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:54:51,120 INFO L93 Difference]: Finished difference Result 60022 states and 199539 transitions. [2019-12-18 19:54:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:54:51,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 19:54:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:54:51,237 INFO L225 Difference]: With dead ends: 60022 [2019-12-18 19:54:51,237 INFO L226 Difference]: Without dead ends: 60022 [2019-12-18 19:54:51,237 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 19:54:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60022 states. [2019-12-18 19:54:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60022 to 60022. [2019-12-18 19:54:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60022 states. [2019-12-18 19:54:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60022 states to 60022 states and 199539 transitions. [2019-12-18 19:54:54,961 INFO L78 Accepts]: Start accepts. Automaton has 60022 states and 199539 transitions. Word has length 16 [2019-12-18 19:54:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:54:54,961 INFO L462 AbstractCegarLoop]: Abstraction has 60022 states and 199539 transitions. [2019-12-18 19:54:54,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:54:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 60022 states and 199539 transitions. [2019-12-18 19:54:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:54:54,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:54:54,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:54:54,967 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:54:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:54:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash -102968596, now seen corresponding path program 1 times [2019-12-18 19:54:54,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:54:54,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066984287] [2019-12-18 19:54:54,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:54:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:54:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:54:55,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066984287] [2019-12-18 19:54:55,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:54:55,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:54:55,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540705657] [2019-12-18 19:54:55,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:54:55,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:54:55,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:54:55,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:54:55,043 INFO L87 Difference]: Start difference. First operand 60022 states and 199539 transitions. Second operand 4 states. [2019-12-18 19:54:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:54:55,628 INFO L93 Difference]: Finished difference Result 73471 states and 240719 transitions. [2019-12-18 19:54:55,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:54:55,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 19:54:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:54:55,774 INFO L225 Difference]: With dead ends: 73471 [2019-12-18 19:54:55,775 INFO L226 Difference]: Without dead ends: 73454 [2019-12-18 19:54:55,775 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 19:54:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73454 states. [2019-12-18 19:54:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73454 to 60574. [2019-12-18 19:54:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60574 states. [2019-12-18 19:54:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60574 states to 60574 states and 201407 transitions. [2019-12-18 19:54:57,946 INFO L78 Accepts]: Start accepts. Automaton has 60574 states and 201407 transitions. Word has length 17 [2019-12-18 19:54:57,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:54:57,946 INFO L462 AbstractCegarLoop]: Abstraction has 60574 states and 201407 transitions. [2019-12-18 19:54:57,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:54:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 60574 states and 201407 transitions. [2019-12-18 19:54:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:54:57,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:54:57,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:54:57,953 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:54:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:54:57,953 INFO L82 PathProgramCache]: Analyzing trace with hash -984006585, now seen corresponding path program 1 times [2019-12-18 19:54:57,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:54:57,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989141617] [2019-12-18 19:54:57,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:54:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:54:58,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 19:54:58,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989141617] [2019-12-18 19:54:58,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:54:58,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:54:58,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164549938] [2019-12-18 19:54:58,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:54:58,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:54:58,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:54:58,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:54:58,007 INFO L87 Difference]: Start difference. First operand 60574 states and 201407 transitions. Second operand 3 states. [2019-12-18 19:54:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:54:58,252 INFO L93 Difference]: Finished difference Result 57003 states and 189266 transitions. [2019-12-18 19:54:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:54:58,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 19:54:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:54:58,366 INFO L225 Difference]: With dead ends: 57003 [2019-12-18 19:54:58,366 INFO L226 Difference]: Without dead ends: 56877 [2019-12-18 19:54:58,367 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 19:54:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56877 states. [2019-12-18 19:55:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56877 to 56877. [2019-12-18 19:55:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56877 states. [2019-12-18 19:55:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56877 states to 56877 states and 188879 transitions. [2019-12-18 19:55:01,509 INFO L78 Accepts]: Start accepts. Automaton has 56877 states and 188879 transitions. Word has length 17 [2019-12-18 19:55:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:01,509 INFO L462 AbstractCegarLoop]: Abstraction has 56877 states and 188879 transitions. [2019-12-18 19:55:01,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 56877 states and 188879 transitions. [2019-12-18 19:55:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 19:55:01,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:01,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] [2019-12-18 19:55:01,520 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:01,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1689107289, now seen corresponding path program 1 times [2019-12-18 19:55:01,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:01,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586588075] [2019-12-18 19:55:01,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:01,615 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 19:55:01,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586588075] [2019-12-18 19:55:01,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:01,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:55:01,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159372920] [2019-12-18 19:55:01,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:55:01,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:01,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:55:01,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:01,618 INFO L87 Difference]: Start difference. First operand 56877 states and 188879 transitions. Second operand 5 states. [2019-12-18 19:55:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:02,629 INFO L93 Difference]: Finished difference Result 80572 states and 260596 transitions. [2019-12-18 19:55:02,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:55:02,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-18 19:55:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:02,783 INFO L225 Difference]: With dead ends: 80572 [2019-12-18 19:55:02,783 INFO L226 Difference]: Without dead ends: 80558 [2019-12-18 19:55:02,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:55:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80558 states. [2019-12-18 19:55:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80558 to 61629. [2019-12-18 19:55:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61629 states. [2019-12-18 19:55:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61629 states to 61629 states and 203651 transitions. [2019-12-18 19:55:07,221 INFO L78 Accepts]: Start accepts. Automaton has 61629 states and 203651 transitions. Word has length 20 [2019-12-18 19:55:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:07,221 INFO L462 AbstractCegarLoop]: Abstraction has 61629 states and 203651 transitions. [2019-12-18 19:55:07,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:55:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 61629 states and 203651 transitions. [2019-12-18 19:55:07,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:55:07,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:07,238 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 19:55:07,238 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:07,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:07,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2089011230, now seen corresponding path program 1 times [2019-12-18 19:55:07,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:07,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434839630] [2019-12-18 19:55:07,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:07,301 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 19:55:07,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434839630] [2019-12-18 19:55:07,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:07,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:55:07,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805188968] [2019-12-18 19:55:07,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:55:07,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:07,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:55:07,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:55:07,303 INFO L87 Difference]: Start difference. First operand 61629 states and 203651 transitions. Second operand 4 states. [2019-12-18 19:55:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:07,374 INFO L93 Difference]: Finished difference Result 11937 states and 32068 transitions. [2019-12-18 19:55:07,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:55:07,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 19:55:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:07,384 INFO L225 Difference]: With dead ends: 11937 [2019-12-18 19:55:07,384 INFO L226 Difference]: Without dead ends: 7333 [2019-12-18 19:55:07,385 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 19:55:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7333 states. [2019-12-18 19:55:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7333 to 7293. [2019-12-18 19:55:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7293 states. [2019-12-18 19:55:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7293 states to 7293 states and 16943 transitions. [2019-12-18 19:55:07,463 INFO L78 Accepts]: Start accepts. Automaton has 7293 states and 16943 transitions. Word has length 23 [2019-12-18 19:55:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:07,464 INFO L462 AbstractCegarLoop]: Abstraction has 7293 states and 16943 transitions. [2019-12-18 19:55:07,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:55:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7293 states and 16943 transitions. [2019-12-18 19:55:07,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:55:07,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:07,470 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] [2019-12-18 19:55:07,470 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:07,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:07,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1983201381, now seen corresponding path program 1 times [2019-12-18 19:55:07,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:07,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426963843] [2019-12-18 19:55:07,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:07,509 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 19:55:07,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426963843] [2019-12-18 19:55:07,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:07,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:55:07,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958784246] [2019-12-18 19:55:07,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:55:07,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:07,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:55:07,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:55:07,512 INFO L87 Difference]: Start difference. First operand 7293 states and 16943 transitions. Second operand 3 states. [2019-12-18 19:55:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:07,592 INFO L93 Difference]: Finished difference Result 7826 states and 17221 transitions. [2019-12-18 19:55:07,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:55:07,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-18 19:55:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:07,602 INFO L225 Difference]: With dead ends: 7826 [2019-12-18 19:55:07,602 INFO L226 Difference]: Without dead ends: 7826 [2019-12-18 19:55:07,602 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 19:55:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7826 states. [2019-12-18 19:55:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7826 to 7274. [2019-12-18 19:55:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7274 states. [2019-12-18 19:55:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7274 states to 7274 states and 16073 transitions. [2019-12-18 19:55:07,694 INFO L78 Accepts]: Start accepts. Automaton has 7274 states and 16073 transitions. Word has length 31 [2019-12-18 19:55:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:07,694 INFO L462 AbstractCegarLoop]: Abstraction has 7274 states and 16073 transitions. [2019-12-18 19:55:07,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 7274 states and 16073 transitions. [2019-12-18 19:55:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 19:55:07,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:07,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:07,701 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:07,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:07,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1139326676, now seen corresponding path program 1 times [2019-12-18 19:55:07,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:07,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088087366] [2019-12-18 19:55:07,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:07,762 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 19:55:07,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088087366] [2019-12-18 19:55:07,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:07,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:55:07,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194599831] [2019-12-18 19:55:07,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:55:07,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:07,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:55:07,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:07,764 INFO L87 Difference]: Start difference. First operand 7274 states and 16073 transitions. Second operand 5 states. [2019-12-18 19:55:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:08,188 INFO L93 Difference]: Finished difference Result 8157 states and 17754 transitions. [2019-12-18 19:55:08,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:55:08,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 19:55:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:08,199 INFO L225 Difference]: With dead ends: 8157 [2019-12-18 19:55:08,200 INFO L226 Difference]: Without dead ends: 8156 [2019-12-18 19:55:08,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:55:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8156 states. [2019-12-18 19:55:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8156 to 6435. [2019-12-18 19:55:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6435 states. [2019-12-18 19:55:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 14377 transitions. [2019-12-18 19:55:08,307 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 14377 transitions. Word has length 34 [2019-12-18 19:55:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:08,307 INFO L462 AbstractCegarLoop]: Abstraction has 6435 states and 14377 transitions. [2019-12-18 19:55:08,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:55:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 14377 transitions. [2019-12-18 19:55:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 19:55:08,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:08,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:08,317 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1938289387, now seen corresponding path program 1 times [2019-12-18 19:55:08,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:08,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878797098] [2019-12-18 19:55:08,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:08,382 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 19:55:08,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878797098] [2019-12-18 19:55:08,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:08,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:55:08,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924767216] [2019-12-18 19:55:08,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:55:08,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:08,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:55:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:08,385 INFO L87 Difference]: Start difference. First operand 6435 states and 14377 transitions. Second operand 5 states. [2019-12-18 19:55:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:08,510 INFO L93 Difference]: Finished difference Result 9458 states and 21247 transitions. [2019-12-18 19:55:08,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:55:08,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 19:55:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:08,521 INFO L225 Difference]: With dead ends: 9458 [2019-12-18 19:55:08,521 INFO L226 Difference]: Without dead ends: 7666 [2019-12-18 19:55:08,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:55:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7666 states. [2019-12-18 19:55:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7666 to 7666. [2019-12-18 19:55:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7666 states. [2019-12-18 19:55:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7666 states to 7666 states and 17278 transitions. [2019-12-18 19:55:08,633 INFO L78 Accepts]: Start accepts. Automaton has 7666 states and 17278 transitions. Word has length 42 [2019-12-18 19:55:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:08,633 INFO L462 AbstractCegarLoop]: Abstraction has 7666 states and 17278 transitions. [2019-12-18 19:55:08,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:55:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7666 states and 17278 transitions. [2019-12-18 19:55:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 19:55:08,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:08,642 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] [2019-12-18 19:55:08,643 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:08,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash -873763311, now seen corresponding path program 1 times [2019-12-18 19:55:08,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:08,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945621919] [2019-12-18 19:55:08,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:08,704 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 19:55:08,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945621919] [2019-12-18 19:55:08,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:08,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:55:08,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176199412] [2019-12-18 19:55:08,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:55:08,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:08,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:55:08,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:55:08,707 INFO L87 Difference]: Start difference. First operand 7666 states and 17278 transitions. Second operand 4 states. [2019-12-18 19:55:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:08,749 INFO L93 Difference]: Finished difference Result 8673 states and 19490 transitions. [2019-12-18 19:55:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:55:08,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-18 19:55:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:08,759 INFO L225 Difference]: With dead ends: 8673 [2019-12-18 19:55:08,759 INFO L226 Difference]: Without dead ends: 6642 [2019-12-18 19:55:08,764 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 19:55:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6642 states. [2019-12-18 19:55:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6642 to 6622. [2019-12-18 19:55:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6622 states. [2019-12-18 19:55:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6622 states to 6622 states and 14891 transitions. [2019-12-18 19:55:08,864 INFO L78 Accepts]: Start accepts. Automaton has 6622 states and 14891 transitions. Word has length 43 [2019-12-18 19:55:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:08,864 INFO L462 AbstractCegarLoop]: Abstraction has 6622 states and 14891 transitions. [2019-12-18 19:55:08,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:55:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6622 states and 14891 transitions. [2019-12-18 19:55:08,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 19:55:08,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:08,876 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] [2019-12-18 19:55:08,876 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:08,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2045858329, now seen corresponding path program 2 times [2019-12-18 19:55:08,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:08,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670850027] [2019-12-18 19:55:08,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:08,966 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 19:55:08,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670850027] [2019-12-18 19:55:08,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:08,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:55:08,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330291250] [2019-12-18 19:55:08,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:55:08,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:08,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:55:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:08,968 INFO L87 Difference]: Start difference. First operand 6622 states and 14891 transitions. Second operand 5 states. [2019-12-18 19:55:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:09,494 INFO L93 Difference]: Finished difference Result 7360 states and 16386 transitions. [2019-12-18 19:55:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:55:09,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 19:55:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:09,504 INFO L225 Difference]: With dead ends: 7360 [2019-12-18 19:55:09,504 INFO L226 Difference]: Without dead ends: 7360 [2019-12-18 19:55:09,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:55:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2019-12-18 19:55:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 7160. [2019-12-18 19:55:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7160 states. [2019-12-18 19:55:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7160 states to 7160 states and 16003 transitions. [2019-12-18 19:55:09,775 INFO L78 Accepts]: Start accepts. Automaton has 7160 states and 16003 transitions. Word has length 43 [2019-12-18 19:55:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:09,776 INFO L462 AbstractCegarLoop]: Abstraction has 7160 states and 16003 transitions. [2019-12-18 19:55:09,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:55:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 7160 states and 16003 transitions. [2019-12-18 19:55:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 19:55:09,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:09,784 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] [2019-12-18 19:55:09,784 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:09,785 INFO L82 PathProgramCache]: Analyzing trace with hash -985992108, now seen corresponding path program 1 times [2019-12-18 19:55:09,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:09,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862744423] [2019-12-18 19:55:09,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:09,880 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 19:55:09,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862744423] [2019-12-18 19:55:09,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:09,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:55:09,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463567886] [2019-12-18 19:55:09,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:55:09,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:09,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:55:09,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:09,882 INFO L87 Difference]: Start difference. First operand 7160 states and 16003 transitions. Second operand 5 states. [2019-12-18 19:55:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:09,938 INFO L93 Difference]: Finished difference Result 5274 states and 11717 transitions. [2019-12-18 19:55:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:55:09,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-18 19:55:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:09,940 INFO L225 Difference]: With dead ends: 5274 [2019-12-18 19:55:09,940 INFO L226 Difference]: Without dead ends: 917 [2019-12-18 19:55:09,941 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 19:55:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-12-18 19:55:09,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 875. [2019-12-18 19:55:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-12-18 19:55:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1764 transitions. [2019-12-18 19:55:09,954 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1764 transitions. Word has length 44 [2019-12-18 19:55:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:09,955 INFO L462 AbstractCegarLoop]: Abstraction has 875 states and 1764 transitions. [2019-12-18 19:55:09,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:55:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1764 transitions. [2019-12-18 19:55:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 19:55:09,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:09,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:09,958 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:09,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:09,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1013481127, now seen corresponding path program 1 times [2019-12-18 19:55:09,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:09,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134086362] [2019-12-18 19:55:09,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:10,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 19:55:10,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134086362] [2019-12-18 19:55:10,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:10,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:55:10,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937559718] [2019-12-18 19:55:10,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:55:10,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:10,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:55:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:55:10,058 INFO L87 Difference]: Start difference. First operand 875 states and 1764 transitions. Second operand 8 states. [2019-12-18 19:55:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:10,295 INFO L93 Difference]: Finished difference Result 1602 states and 3203 transitions. [2019-12-18 19:55:10,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:55:10,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-18 19:55:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:10,297 INFO L225 Difference]: With dead ends: 1602 [2019-12-18 19:55:10,297 INFO L226 Difference]: Without dead ends: 1119 [2019-12-18 19:55:10,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:55:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-12-18 19:55:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 931. [2019-12-18 19:55:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-18 19:55:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1858 transitions. [2019-12-18 19:55:10,310 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1858 transitions. Word has length 59 [2019-12-18 19:55:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:10,311 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1858 transitions. [2019-12-18 19:55:10,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:55:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1858 transitions. [2019-12-18 19:55:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 19:55:10,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:10,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:10,313 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:10,314 INFO L82 PathProgramCache]: Analyzing trace with hash 411755865, now seen corresponding path program 2 times [2019-12-18 19:55:10,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:10,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309580114] [2019-12-18 19:55:10,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:10,388 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 19:55:10,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309580114] [2019-12-18 19:55:10,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:10,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:55:10,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442904148] [2019-12-18 19:55:10,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:55:10,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:10,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:55:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:55:10,390 INFO L87 Difference]: Start difference. First operand 931 states and 1858 transitions. Second operand 6 states. [2019-12-18 19:55:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:10,851 INFO L93 Difference]: Finished difference Result 1059 states and 2089 transitions. [2019-12-18 19:55:10,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:55:10,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 19:55:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:10,852 INFO L225 Difference]: With dead ends: 1059 [2019-12-18 19:55:10,853 INFO L226 Difference]: Without dead ends: 1059 [2019-12-18 19:55:10,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:55:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-12-18 19:55:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 961. [2019-12-18 19:55:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-12-18 19:55:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1913 transitions. [2019-12-18 19:55:10,866 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1913 transitions. Word has length 59 [2019-12-18 19:55:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:10,867 INFO L462 AbstractCegarLoop]: Abstraction has 961 states and 1913 transitions. [2019-12-18 19:55:10,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:55:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1913 transitions. [2019-12-18 19:55:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 19:55:10,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:10,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:10,869 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2044824263, now seen corresponding path program 3 times [2019-12-18 19:55:10,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:10,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811426145] [2019-12-18 19:55:10,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:10,969 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 19:55:10,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811426145] [2019-12-18 19:55:10,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:10,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:55:10,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446033901] [2019-12-18 19:55:10,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:55:10,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:10,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:55:10,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:55:10,976 INFO L87 Difference]: Start difference. First operand 961 states and 1913 transitions. Second operand 3 states. [2019-12-18 19:55:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:10,992 INFO L93 Difference]: Finished difference Result 961 states and 1912 transitions. [2019-12-18 19:55:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:55:10,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 19:55:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:10,994 INFO L225 Difference]: With dead ends: 961 [2019-12-18 19:55:10,994 INFO L226 Difference]: Without dead ends: 961 [2019-12-18 19:55:10,994 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 19:55:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-12-18 19:55:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 816. [2019-12-18 19:55:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-12-18 19:55:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1647 transitions. [2019-12-18 19:55:11,006 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1647 transitions. Word has length 59 [2019-12-18 19:55:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:11,007 INFO L462 AbstractCegarLoop]: Abstraction has 816 states and 1647 transitions. [2019-12-18 19:55:11,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1647 transitions. [2019-12-18 19:55:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 19:55:11,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:11,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:11,009 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash -103560940, now seen corresponding path program 1 times [2019-12-18 19:55:11,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:11,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048041464] [2019-12-18 19:55:11,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:55:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:55:11,179 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:55:11,179 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:55:11,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_45| 0 0))) (and (= 0 v_~x$w_buff0_used~0_130) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t8~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t8~0.base_21|) |v_ULTIMATE.start_main_~#t8~0.offset_17| 0)) |v_#memory_int_15|) (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$w_buff1_used~0_66 0) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_33) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~x$flush_delayed~0_17 0) (= v_~x$r_buff1_thd2~0_35 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd1~0_53) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= |v_#valid_43| (store .cse0 |v_ULTIMATE.start_main_~#t8~0.base_21| 1)) (= v_~x~0_31 0) (= 0 |v_ULTIMATE.start_main_~#t8~0.offset_17|) (= v_~x$mem_tmp~0_12 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~y~0_8) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t8~0.base_21| 4) |v_#length_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t8~0.base_21|)) (= |v_#NULL.offset_4| 0) (= v_~x$r_buff1_thd0~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_17) (= v_~x$r_buff1_thd1~0_27 0) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_16 0) (= 0 v_~x$w_buff0~0_35) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t8~0.base_21|) (= 0 v_~x$r_buff0_thd2~0_75) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t8~0.base=|v_ULTIMATE.start_main_~#t8~0.base_21|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, #length=|v_#length_17|, ~y~0=v_~y~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_33, ULTIMATE.start_main_~#t8~0.offset=|v_ULTIMATE.start_main_~#t8~0.offset_17|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_66, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_35, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_24, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_75, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_24|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t9~0.offset=|v_ULTIMATE.start_main_~#t9~0.offset_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_~#t9~0.base=|v_ULTIMATE.start_main_~#t9~0.base_18|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ULTIMATE.start_main_~#t8~0.base, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_~#t8~0.offset, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t9~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t9~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 19:55:11,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L813-1-->L815: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t9~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t9~0.base_12|) |v_ULTIMATE.start_main_~#t9~0.offset_10| 1))) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t9~0.base_12| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t9~0.base_12| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t9~0.base_12|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t9~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t9~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t9~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t9~0.offset=|v_ULTIMATE.start_main_~#t9~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t9~0.base=|v_ULTIMATE.start_main_~#t9~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t9~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t9~0.base] because there is no mapped edge [2019-12-18 19:55:11,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_22 v_~x$w_buff1~0_24) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= 1 v_~x$w_buff0~0_21) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_~x$w_buff1_used~0_53 v_~x$w_buff0_used~0_98) (= 1 v_~x$w_buff0_used~0_97) (= (mod v_~x$w_buff1_used~0_53 256) 0) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_24, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 19:55:11,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1364979262 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1364979262 256)))) (or (and (= ~x$w_buff1~0_In-1364979262 |P1Thread1of1ForFork1_#t~ite28_Out-1364979262|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1364979262| ~x$w_buff0~0_In-1364979262)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1364979262, ~x$w_buff1~0=~x$w_buff1~0_In-1364979262, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1364979262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1364979262} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1364979262, ~x$w_buff1~0=~x$w_buff1~0_In-1364979262, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1364979262, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1364979262|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1364979262} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 19:55:11,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_20 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_7|, ~x~0=v_~x~0_20, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 19:55:11,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~x$r_buff0_thd2~0_54 v_~x$r_buff0_thd2~0_53)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 19:55:11,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In931056541 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out931056541| ~x~0_In931056541)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out931056541| ~x$mem_tmp~0_In931056541) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In931056541, ~x$mem_tmp~0=~x$mem_tmp~0_In931056541, ~x~0=~x~0_In931056541} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In931056541, ~x$mem_tmp~0=~x$mem_tmp~0_In931056541, ~x~0=~x~0_In931056541, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out931056541|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 19:55:11,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1823423028 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1823423028 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-1823423028| ~x$w_buff0_used~0_In-1823423028)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out-1823423028| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1823423028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1823423028} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1823423028|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1823423028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1823423028} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-18 19:55:11,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In651495444 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In651495444 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In651495444 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In651495444 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite52_Out651495444| ~x$w_buff1_used~0_In651495444) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out651495444|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In651495444, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In651495444, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In651495444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In651495444} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out651495444|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In651495444, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In651495444, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In651495444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In651495444} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-18 19:55:11,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1394021620 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1394021620 256)))) (or (and (= ~x$r_buff0_thd2~0_In-1394021620 ~x$r_buff0_thd2~0_Out-1394021620) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out-1394021620) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1394021620, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1394021620} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1394021620|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1394021620, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1394021620} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 19:55:11,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In646153276 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In646153276 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In646153276 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In646153276 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out646153276|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In646153276 |P1Thread1of1ForFork1_#t~ite54_Out646153276|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In646153276, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In646153276, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In646153276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In646153276} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In646153276, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In646153276, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out646153276|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In646153276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In646153276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 19:55:11,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_31 |v_P1Thread1of1ForFork1_#t~ite54_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_31, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 19:55:11,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In410371335 256) 0))) (or (and .cse0 (= ~x~0_In410371335 |P0Thread1of1ForFork0_#t~ite25_Out410371335|)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out410371335| ~x$mem_tmp~0_In410371335)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In410371335, ~x$mem_tmp~0=~x$mem_tmp~0_In410371335, ~x~0=~x~0_In410371335} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out410371335|, ~x$flush_delayed~0=~x$flush_delayed~0_In410371335, ~x$mem_tmp~0=~x$mem_tmp~0_In410371335, ~x~0=~x~0_In410371335} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-18 19:55:11,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L747-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x~0_26 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= v_~x$flush_delayed~0_12 0) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 19:55:11,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_106 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_16 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 19:55:11,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-768639175 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-768639175| |ULTIMATE.start_main_#t~ite57_Out-768639175|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-768639175 256)))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out-768639175| ~x~0_In-768639175) (or .cse0 .cse1) .cse2) (and (not .cse1) (= ~x$w_buff1~0_In-768639175 |ULTIMATE.start_main_#t~ite57_Out-768639175|) .cse2 (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-768639175, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-768639175, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-768639175, ~x~0=~x~0_In-768639175} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-768639175, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-768639175|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-768639175|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-768639175, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-768639175, ~x~0=~x~0_In-768639175} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-18 19:55:11,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1641132711 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1641132711 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1641132711| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out1641132711| ~x$w_buff0_used~0_In1641132711)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1641132711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1641132711} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1641132711, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1641132711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1641132711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 19:55:11,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-58153272 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-58153272 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-58153272 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-58153272 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite60_Out-58153272| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-58153272 |ULTIMATE.start_main_#t~ite60_Out-58153272|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-58153272, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-58153272, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-58153272, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-58153272} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-58153272, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-58153272|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-58153272, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-58153272, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-58153272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 19:55:11,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1345979015 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1345979015 256)))) (or (and (= ~x$r_buff0_thd0~0_In1345979015 |ULTIMATE.start_main_#t~ite61_Out1345979015|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out1345979015|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1345979015, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1345979015} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1345979015, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1345979015|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1345979015} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 19:55:11,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In327494256 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In327494256 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In327494256 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In327494256 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out327494256| ~x$r_buff1_thd0~0_In327494256)) (and (= |ULTIMATE.start_main_#t~ite62_Out327494256| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In327494256, ~x$w_buff1_used~0=~x$w_buff1_used~0_In327494256, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In327494256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In327494256} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out327494256|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In327494256, ~x$w_buff1_used~0=~x$w_buff1_used~0_In327494256, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In327494256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In327494256} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 19:55:11,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_~main$tmp_guard1~0_8 0) (= 1 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p0_EAX~0_7 1) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite62_12|)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:55:11,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:55:11 BasicIcfg [2019-12-18 19:55:11,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:55:11,349 INFO L168 Benchmark]: Toolchain (without parser) took 42917.08 ms. Allocated memory was 145.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 100.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 855.2 MB. Max. memory is 7.1 GB. [2019-12-18 19:55:11,353 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 19:55:11,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.05 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 156.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:55:11,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.49 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:55:11,357 INFO L168 Benchmark]: Boogie Preprocessor took 45.89 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:55:11,358 INFO L168 Benchmark]: RCFGBuilder took 919.48 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 98.4 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:55:11,359 INFO L168 Benchmark]: TraceAbstraction took 41136.69 ms. Allocated memory was 203.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 97.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 794.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:55:11,362 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 734.05 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 156.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.49 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.89 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 919.48 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 98.4 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41136.69 ms. Allocated memory was 203.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 97.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 794.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 179 ProgramPointsBefore, 107 ProgramPointsAfterwards, 228 TransitionsBefore, 132 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 27 ChoiceCompositions, 8706 VarBasedMoverChecksPositive, 225 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 130993 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t8, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t9, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 40.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3794 SDtfs, 3314 SDslu, 5737 SDs, 0 SdLazy, 2542 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61629occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 47923 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 534 ConstructedInterpolants, 0 QuantifiedInterpolants, 58806 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...