/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/mix022_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:43:09,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:43:09,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:43:09,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:43:09,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:43:09,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:43:09,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:43:09,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:43:09,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:43:09,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:43:09,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:43:09,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:43:09,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:43:09,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:43:09,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:43:09,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:43:09,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:43:09,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:43:09,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:43:09,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:43:09,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:43:09,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:43:09,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:43:09,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:43:09,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:43:09,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:43:09,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:43:09,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:43:09,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:43:09,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:43:09,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:43:09,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:43:09,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:43:09,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:43:09,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:43:09,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:43:09,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:43:09,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:43:09,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:43:09,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:43:09,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:43:09,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:43:09,205 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:43:09,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:43:09,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:43:09,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:43:09,207 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:43:09,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:43:09,207 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:43:09,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:43:09,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:43:09,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:43:09,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:43:09,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:43:09,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:43:09,209 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:43:09,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:43:09,209 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:43:09,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:43:09,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:43:09,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:43:09,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:43:09,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:43:09,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:43:09,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:43:09,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:43:09,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:43:09,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:43:09,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:43:09,211 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:43:09,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:43:09,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:43:09,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:43:09,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:43:09,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:43:09,518 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:43:09,518 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:43:09,519 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i [2019-12-18 20:43:09,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fd7f361/386ba232cccd4d689d4342aae7adb5d9/FLAG374515202 [2019-12-18 20:43:10,186 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:43:10,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i [2019-12-18 20:43:10,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fd7f361/386ba232cccd4d689d4342aae7adb5d9/FLAG374515202 [2019-12-18 20:43:10,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fd7f361/386ba232cccd4d689d4342aae7adb5d9 [2019-12-18 20:43:10,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:43:10,434 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:43:10,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:43:10,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:43:10,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:43:10,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:43:10" (1/1) ... [2019-12-18 20:43:10,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b12efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:10, skipping insertion in model container [2019-12-18 20:43:10,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:43:10" (1/1) ... [2019-12-18 20:43:10,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:43:10,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:43:11,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:43:11,109 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:43:11,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:43:11,311 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:43:11,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11 WrapperNode [2019-12-18 20:43:11,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:43:11,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:43:11,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:43:11,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:43:11,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (1/1) ... [2019-12-18 20:43:11,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (1/1) ... [2019-12-18 20:43:11,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:43:11,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:43:11,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:43:11,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:43:11,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (1/1) ... [2019-12-18 20:43:11,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (1/1) ... [2019-12-18 20:43:11,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (1/1) ... [2019-12-18 20:43:11,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (1/1) ... [2019-12-18 20:43:11,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (1/1) ... [2019-12-18 20:43:11,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (1/1) ... [2019-12-18 20:43:11,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (1/1) ... [2019-12-18 20:43:11,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:43:11,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:43:11,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:43:11,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:43:11,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:43:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:43:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:43:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:43:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:43:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:43:11,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:43:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:43:11,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:43:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:43:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:43:11,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:43:11,512 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:43:12,287 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:43:12,287 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:43:12,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:43:12 BoogieIcfgContainer [2019-12-18 20:43:12,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:43:12,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:43:12,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:43:12,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:43:12,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:43:10" (1/3) ... [2019-12-18 20:43:12,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb63efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:43:12, skipping insertion in model container [2019-12-18 20:43:12,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:11" (2/3) ... [2019-12-18 20:43:12,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb63efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:43:12, skipping insertion in model container [2019-12-18 20:43:12,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:43:12" (3/3) ... [2019-12-18 20:43:12,301 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_tso.opt.i [2019-12-18 20:43:12,310 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:43:12,310 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:43:12,322 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:43:12,323 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:43:12,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,407 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,407 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,443 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,443 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,448 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,451 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:12,467 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 20:43:12,489 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:43:12,489 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:43:12,489 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:43:12,490 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:43:12,490 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:43:12,490 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:43:12,490 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:43:12,490 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:43:12,510 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-18 20:43:12,512 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-18 20:43:12,671 INFO L126 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-18 20:43:12,671 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:43:12,697 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 20:43:12,729 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-18 20:43:12,822 INFO L126 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-18 20:43:12,822 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:43:12,834 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 20:43:12,866 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-18 20:43:12,867 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:43:16,297 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 20:43:16,432 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 20:43:16,488 INFO L206 etLargeBlockEncoding]: Checked pairs total: 164896 [2019-12-18 20:43:16,489 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 20:43:16,492 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 139 transitions [2019-12-18 20:43:18,273 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 28693 states. [2019-12-18 20:43:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 28693 states. [2019-12-18 20:43:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 20:43:18,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:18,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 20:43:18,282 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:18,287 INFO L82 PathProgramCache]: Analyzing trace with hash 976559034, now seen corresponding path program 1 times [2019-12-18 20:43:18,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:18,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713824874] [2019-12-18 20:43:18,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:18,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713824874] [2019-12-18 20:43:18,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:18,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:43:18,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259914510] [2019-12-18 20:43:18,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:18,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:18,630 INFO L87 Difference]: Start difference. First operand 28693 states. Second operand 3 states. [2019-12-18 20:43:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:20,013 INFO L93 Difference]: Finished difference Result 28603 states and 100987 transitions. [2019-12-18 20:43:20,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:20,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 20:43:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:20,264 INFO L225 Difference]: With dead ends: 28603 [2019-12-18 20:43:20,264 INFO L226 Difference]: Without dead ends: 28044 [2019-12-18 20:43:20,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28044 states. [2019-12-18 20:43:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28044 to 28044. [2019-12-18 20:43:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28044 states. [2019-12-18 20:43:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28044 states to 28044 states and 99141 transitions. [2019-12-18 20:43:21,984 INFO L78 Accepts]: Start accepts. Automaton has 28044 states and 99141 transitions. Word has length 5 [2019-12-18 20:43:21,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:21,984 INFO L462 AbstractCegarLoop]: Abstraction has 28044 states and 99141 transitions. [2019-12-18 20:43:21,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28044 states and 99141 transitions. [2019-12-18 20:43:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:43:21,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:21,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:21,988 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:21,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash 727953079, now seen corresponding path program 1 times [2019-12-18 20:43:21,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:21,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871551166] [2019-12-18 20:43:21,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:22,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871551166] [2019-12-18 20:43:22,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:22,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:22,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930487173] [2019-12-18 20:43:22,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:43:22,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:43:22,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:43:22,126 INFO L87 Difference]: Start difference. First operand 28044 states and 99141 transitions. Second operand 4 states. [2019-12-18 20:43:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:22,902 INFO L93 Difference]: Finished difference Result 45067 states and 151887 transitions. [2019-12-18 20:43:22,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:43:22,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:43:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:23,085 INFO L225 Difference]: With dead ends: 45067 [2019-12-18 20:43:23,085 INFO L226 Difference]: Without dead ends: 45060 [2019-12-18 20:43:23,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45060 states. [2019-12-18 20:43:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45060 to 43678. [2019-12-18 20:43:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43678 states. [2019-12-18 20:43:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43678 states to 43678 states and 148274 transitions. [2019-12-18 20:43:26,004 INFO L78 Accepts]: Start accepts. Automaton has 43678 states and 148274 transitions. Word has length 11 [2019-12-18 20:43:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:26,005 INFO L462 AbstractCegarLoop]: Abstraction has 43678 states and 148274 transitions. [2019-12-18 20:43:26,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:43:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 43678 states and 148274 transitions. [2019-12-18 20:43:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:43:26,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:26,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:26,015 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash -569945878, now seen corresponding path program 1 times [2019-12-18 20:43:26,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:26,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348704583] [2019-12-18 20:43:26,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:26,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 20:43:26,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348704583] [2019-12-18 20:43:26,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:26,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:26,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67090333] [2019-12-18 20:43:26,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:43:26,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:26,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:43:26,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:43:26,116 INFO L87 Difference]: Start difference. First operand 43678 states and 148274 transitions. Second operand 4 states. [2019-12-18 20:43:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:27,828 INFO L93 Difference]: Finished difference Result 54479 states and 183229 transitions. [2019-12-18 20:43:27,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:43:27,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:43:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:27,979 INFO L225 Difference]: With dead ends: 54479 [2019-12-18 20:43:27,980 INFO L226 Difference]: Without dead ends: 54479 [2019-12-18 20:43:27,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54479 states. [2019-12-18 20:43:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54479 to 49001. [2019-12-18 20:43:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49001 states. [2019-12-18 20:43:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49001 states to 49001 states and 166041 transitions. [2019-12-18 20:43:29,683 INFO L78 Accepts]: Start accepts. Automaton has 49001 states and 166041 transitions. Word has length 11 [2019-12-18 20:43:29,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:29,683 INFO L462 AbstractCegarLoop]: Abstraction has 49001 states and 166041 transitions. [2019-12-18 20:43:29,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:43:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 49001 states and 166041 transitions. [2019-12-18 20:43:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 20:43:29,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:29,689 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 20:43:29,689 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:29,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1242100263, now seen corresponding path program 1 times [2019-12-18 20:43:29,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:29,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977106019] [2019-12-18 20:43:29,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:29,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977106019] [2019-12-18 20:43:29,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:29,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:43:29,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192406154] [2019-12-18 20:43:29,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:43:29,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:29,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:43:29,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:29,804 INFO L87 Difference]: Start difference. First operand 49001 states and 166041 transitions. Second operand 5 states. [2019-12-18 20:43:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:31,012 INFO L93 Difference]: Finished difference Result 64731 states and 215221 transitions. [2019-12-18 20:43:31,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:43:31,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 20:43:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:31,126 INFO L225 Difference]: With dead ends: 64731 [2019-12-18 20:43:31,126 INFO L226 Difference]: Without dead ends: 64724 [2019-12-18 20:43:31,127 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 20:43:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64724 states. [2019-12-18 20:43:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64724 to 48844. [2019-12-18 20:43:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48844 states. [2019-12-18 20:43:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48844 states to 48844 states and 165414 transitions. [2019-12-18 20:43:34,135 INFO L78 Accepts]: Start accepts. Automaton has 48844 states and 165414 transitions. Word has length 17 [2019-12-18 20:43:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:34,135 INFO L462 AbstractCegarLoop]: Abstraction has 48844 states and 165414 transitions. [2019-12-18 20:43:34,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:43:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 48844 states and 165414 transitions. [2019-12-18 20:43:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:43:34,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:34,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:34,161 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:34,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1855796261, now seen corresponding path program 1 times [2019-12-18 20:43:34,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:34,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47973259] [2019-12-18 20:43:34,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:34,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47973259] [2019-12-18 20:43:34,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:34,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:43:34,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50218937] [2019-12-18 20:43:34,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:43:34,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:34,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:43:34,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:43:34,254 INFO L87 Difference]: Start difference. First operand 48844 states and 165414 transitions. Second operand 4 states. [2019-12-18 20:43:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:34,298 INFO L93 Difference]: Finished difference Result 5701 states and 14235 transitions. [2019-12-18 20:43:34,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:43:34,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:43:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:34,304 INFO L225 Difference]: With dead ends: 5701 [2019-12-18 20:43:34,304 INFO L226 Difference]: Without dead ends: 4806 [2019-12-18 20:43:34,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2019-12-18 20:43:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4806. [2019-12-18 20:43:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2019-12-18 20:43:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 11494 transitions. [2019-12-18 20:43:34,646 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 11494 transitions. Word has length 25 [2019-12-18 20:43:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:34,646 INFO L462 AbstractCegarLoop]: Abstraction has 4806 states and 11494 transitions. [2019-12-18 20:43:34,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:43:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 11494 transitions. [2019-12-18 20:43:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:43:34,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:34,654 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] [2019-12-18 20:43:34,654 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1777657148, now seen corresponding path program 1 times [2019-12-18 20:43:34,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:34,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42730401] [2019-12-18 20:43:34,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:34,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42730401] [2019-12-18 20:43:34,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:34,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:34,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848190993] [2019-12-18 20:43:34,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:43:34,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:34,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:43:34,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:34,771 INFO L87 Difference]: Start difference. First operand 4806 states and 11494 transitions. Second operand 5 states. [2019-12-18 20:43:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:34,815 INFO L93 Difference]: Finished difference Result 1096 states and 2313 transitions. [2019-12-18 20:43:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:43:34,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 20:43:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:34,817 INFO L225 Difference]: With dead ends: 1096 [2019-12-18 20:43:34,817 INFO L226 Difference]: Without dead ends: 992 [2019-12-18 20:43:34,818 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 20:43:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-12-18 20:43:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 950. [2019-12-18 20:43:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-18 20:43:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2011 transitions. [2019-12-18 20:43:34,831 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2011 transitions. Word has length 37 [2019-12-18 20:43:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:34,832 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2011 transitions. [2019-12-18 20:43:34,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:43:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2011 transitions. [2019-12-18 20:43:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 20:43:34,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:34,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:34,837 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1536404517, now seen corresponding path program 1 times [2019-12-18 20:43:34,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:34,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899151628] [2019-12-18 20:43:34,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:34,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899151628] [2019-12-18 20:43:34,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:34,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:43:34,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484206630] [2019-12-18 20:43:34,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:43:34,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:43:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:43:34,988 INFO L87 Difference]: Start difference. First operand 950 states and 2011 transitions. Second operand 6 states. [2019-12-18 20:43:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:35,624 INFO L93 Difference]: Finished difference Result 1406 states and 2952 transitions. [2019-12-18 20:43:35,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 20:43:35,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 20:43:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:35,627 INFO L225 Difference]: With dead ends: 1406 [2019-12-18 20:43:35,627 INFO L226 Difference]: Without dead ends: 1406 [2019-12-18 20:43:35,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:43:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2019-12-18 20:43:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1133. [2019-12-18 20:43:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2019-12-18 20:43:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2398 transitions. [2019-12-18 20:43:35,643 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2398 transitions. Word has length 68 [2019-12-18 20:43:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:35,643 INFO L462 AbstractCegarLoop]: Abstraction has 1133 states and 2398 transitions. [2019-12-18 20:43:35,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:43:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2398 transitions. [2019-12-18 20:43:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 20:43:35,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:35,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:35,646 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:35,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1544266897, now seen corresponding path program 2 times [2019-12-18 20:43:35,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:35,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196292139] [2019-12-18 20:43:35,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:35,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196292139] [2019-12-18 20:43:35,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:35,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:35,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75525258] [2019-12-18 20:43:35,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:35,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:35,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:35,765 INFO L87 Difference]: Start difference. First operand 1133 states and 2398 transitions. Second operand 3 states. [2019-12-18 20:43:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:35,778 INFO L93 Difference]: Finished difference Result 964 states and 1995 transitions. [2019-12-18 20:43:35,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:35,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-18 20:43:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:35,780 INFO L225 Difference]: With dead ends: 964 [2019-12-18 20:43:35,780 INFO L226 Difference]: Without dead ends: 964 [2019-12-18 20:43:35,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-12-18 20:43:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2019-12-18 20:43:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-12-18 20:43:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1995 transitions. [2019-12-18 20:43:35,789 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1995 transitions. Word has length 68 [2019-12-18 20:43:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:35,789 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1995 transitions. [2019-12-18 20:43:35,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1995 transitions. [2019-12-18 20:43:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 20:43:35,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:35,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:35,791 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1098481905, now seen corresponding path program 1 times [2019-12-18 20:43:35,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:35,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673400170] [2019-12-18 20:43:35,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:35,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 20:43:35,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673400170] [2019-12-18 20:43:35,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:35,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:43:35,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036101070] [2019-12-18 20:43:35,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:43:35,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:35,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:43:35,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:35,883 INFO L87 Difference]: Start difference. First operand 964 states and 1995 transitions. Second operand 5 states. [2019-12-18 20:43:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:36,121 INFO L93 Difference]: Finished difference Result 1102 states and 2243 transitions. [2019-12-18 20:43:36,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:43:36,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-18 20:43:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:36,124 INFO L225 Difference]: With dead ends: 1102 [2019-12-18 20:43:36,124 INFO L226 Difference]: Without dead ends: 1102 [2019-12-18 20:43:36,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 20:43:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-12-18 20:43:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1049. [2019-12-18 20:43:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2019-12-18 20:43:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2149 transitions. [2019-12-18 20:43:36,134 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2149 transitions. Word has length 69 [2019-12-18 20:43:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:36,134 INFO L462 AbstractCegarLoop]: Abstraction has 1049 states and 2149 transitions. [2019-12-18 20:43:36,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:43:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2149 transitions. [2019-12-18 20:43:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 20:43:36,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:36,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:36,136 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:36,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1282334367, now seen corresponding path program 2 times [2019-12-18 20:43:36,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:36,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062344275] [2019-12-18 20:43:36,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:36,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062344275] [2019-12-18 20:43:36,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:36,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:36,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864390856] [2019-12-18 20:43:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:43:36,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:43:36,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:36,250 INFO L87 Difference]: Start difference. First operand 1049 states and 2149 transitions. Second operand 5 states. [2019-12-18 20:43:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:36,494 INFO L93 Difference]: Finished difference Result 1222 states and 2481 transitions. [2019-12-18 20:43:36,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:43:36,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-18 20:43:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:36,497 INFO L225 Difference]: With dead ends: 1222 [2019-12-18 20:43:36,497 INFO L226 Difference]: Without dead ends: 1222 [2019-12-18 20:43:36,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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 20:43:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-18 20:43:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1133. [2019-12-18 20:43:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2019-12-18 20:43:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2326 transitions. [2019-12-18 20:43:36,514 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2326 transitions. Word has length 69 [2019-12-18 20:43:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:36,514 INFO L462 AbstractCegarLoop]: Abstraction has 1133 states and 2326 transitions. [2019-12-18 20:43:36,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:43:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2326 transitions. [2019-12-18 20:43:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 20:43:36,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:36,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:36,518 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:36,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:36,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1431949251, now seen corresponding path program 3 times [2019-12-18 20:43:36,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:36,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30845097] [2019-12-18 20:43:36,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:36,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30845097] [2019-12-18 20:43:36,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:36,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:36,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824853239] [2019-12-18 20:43:36,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:36,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:36,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:36,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:36,658 INFO L87 Difference]: Start difference. First operand 1133 states and 2326 transitions. Second operand 3 states. [2019-12-18 20:43:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:36,699 INFO L93 Difference]: Finished difference Result 1132 states and 2324 transitions. [2019-12-18 20:43:36,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:36,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-18 20:43:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:36,701 INFO L225 Difference]: With dead ends: 1132 [2019-12-18 20:43:36,701 INFO L226 Difference]: Without dead ends: 1132 [2019-12-18 20:43:36,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2019-12-18 20:43:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 963. [2019-12-18 20:43:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-18 20:43:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1993 transitions. [2019-12-18 20:43:36,715 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1993 transitions. Word has length 69 [2019-12-18 20:43:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:36,715 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1993 transitions. [2019-12-18 20:43:36,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1993 transitions. [2019-12-18 20:43:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 20:43:36,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:36,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:36,720 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:36,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1085334984, now seen corresponding path program 1 times [2019-12-18 20:43:36,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:36,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563383320] [2019-12-18 20:43:36,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:36,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563383320] [2019-12-18 20:43:36,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:36,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:36,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006044030] [2019-12-18 20:43:36,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:43:36,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:36,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:43:36,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:43:36,855 INFO L87 Difference]: Start difference. First operand 963 states and 1993 transitions. Second operand 4 states. [2019-12-18 20:43:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:37,054 INFO L93 Difference]: Finished difference Result 1089 states and 2220 transitions. [2019-12-18 20:43:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:43:37,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-18 20:43:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:37,056 INFO L225 Difference]: With dead ends: 1089 [2019-12-18 20:43:37,056 INFO L226 Difference]: Without dead ends: 1089 [2019-12-18 20:43:37,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:43:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-12-18 20:43:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1075. [2019-12-18 20:43:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-18 20:43:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2194 transitions. [2019-12-18 20:43:37,070 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2194 transitions. Word has length 70 [2019-12-18 20:43:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:37,070 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2194 transitions. [2019-12-18 20:43:37,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:43:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2194 transitions. [2019-12-18 20:43:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 20:43:37,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:37,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:37,073 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:37,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash 905951930, now seen corresponding path program 2 times [2019-12-18 20:43:37,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:37,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708963212] [2019-12-18 20:43:37,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:37,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708963212] [2019-12-18 20:43:37,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:37,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:43:37,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831083964] [2019-12-18 20:43:37,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:43:37,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:37,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:43:37,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:43:37,215 INFO L87 Difference]: Start difference. First operand 1075 states and 2194 transitions. Second operand 6 states. [2019-12-18 20:43:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:37,476 INFO L93 Difference]: Finished difference Result 1199 states and 2451 transitions. [2019-12-18 20:43:37,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 20:43:37,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-18 20:43:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:37,479 INFO L225 Difference]: With dead ends: 1199 [2019-12-18 20:43:37,479 INFO L226 Difference]: Without dead ends: 1199 [2019-12-18 20:43:37,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:43:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-12-18 20:43:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1075. [2019-12-18 20:43:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-18 20:43:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2178 transitions. [2019-12-18 20:43:37,495 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2178 transitions. Word has length 70 [2019-12-18 20:43:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:37,496 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2178 transitions. [2019-12-18 20:43:37,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:43:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2178 transitions. [2019-12-18 20:43:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 20:43:37,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:37,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:37,499 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash -809138170, now seen corresponding path program 3 times [2019-12-18 20:43:37,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:37,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366853031] [2019-12-18 20:43:37,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:37,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366853031] [2019-12-18 20:43:37,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:37,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:43:37,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061988121] [2019-12-18 20:43:37,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:43:37,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:37,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:43:37,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:43:37,758 INFO L87 Difference]: Start difference. First operand 1075 states and 2178 transitions. Second operand 10 states. [2019-12-18 20:43:38,261 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-18 20:43:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:39,166 INFO L93 Difference]: Finished difference Result 2281 states and 4707 transitions. [2019-12-18 20:43:39,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:43:39,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-12-18 20:43:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:39,170 INFO L225 Difference]: With dead ends: 2281 [2019-12-18 20:43:39,170 INFO L226 Difference]: Without dead ends: 2281 [2019-12-18 20:43:39,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:43:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2019-12-18 20:43:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1257. [2019-12-18 20:43:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-12-18 20:43:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2591 transitions. [2019-12-18 20:43:39,188 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2591 transitions. Word has length 70 [2019-12-18 20:43:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:39,188 INFO L462 AbstractCegarLoop]: Abstraction has 1257 states and 2591 transitions. [2019-12-18 20:43:39,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:43:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2591 transitions. [2019-12-18 20:43:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 20:43:39,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:39,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:39,190 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:39,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:39,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1274905568, now seen corresponding path program 1 times [2019-12-18 20:43:39,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:39,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436298584] [2019-12-18 20:43:39,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:43:39,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436298584] [2019-12-18 20:43:39,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:39,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:43:39,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044916469] [2019-12-18 20:43:39,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:43:39,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:39,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:43:39,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:43:39,316 INFO L87 Difference]: Start difference. First operand 1257 states and 2591 transitions. Second operand 6 states. [2019-12-18 20:43:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:39,417 INFO L93 Difference]: Finished difference Result 1577 states and 3218 transitions. [2019-12-18 20:43:39,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:43:39,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-18 20:43:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:39,418 INFO L225 Difference]: With dead ends: 1577 [2019-12-18 20:43:39,419 INFO L226 Difference]: Without dead ends: 266 [2019-12-18 20:43:39,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:43:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-18 20:43:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 242. [2019-12-18 20:43:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-18 20:43:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 404 transitions. [2019-12-18 20:43:39,425 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 404 transitions. Word has length 71 [2019-12-18 20:43:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:39,425 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 404 transitions. [2019-12-18 20:43:39,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:43:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 404 transitions. [2019-12-18 20:43:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 20:43:39,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:39,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:39,426 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1907394154, now seen corresponding path program 2 times [2019-12-18 20:43:39,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:39,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542051361] [2019-12-18 20:43:39,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:43:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:43:39,589 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:43:39,591 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:43:39,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t599~0.base_24|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t599~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t599~0.base_24|) |v_ULTIMATE.start_main_~#t599~0.offset_18| 0)) |v_#memory_int_15|) (= v_~main$tmp_guard1~0_18 0) (= v_~x$mem_tmp~0_13 0) (= v_~x$r_buff1_thd2~0_40 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t599~0.base_24| 4) |v_#length_17|) (= 0 v_~weak$$choice0~0_9) (= 0 v_~x$r_buff0_thd1~0_20) (= 0 v_~x$w_buff0_used~0_146) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x$flush_delayed~0_23 0) (= 0 v_~x$r_buff0_thd2~0_78) (= v_~x$r_buff1_thd1~0_18 0) (= v_~x$w_buff1_used~0_78 0) (= 0 v_~__unbuffered_cnt~0_14) (= v_~x$r_buff1_thd0~0_37 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t599~0.base_24|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~x$read_delayed~0_7) (= 0 v_~y~0_8) (= 0 v_~x$w_buff1~0_36) (= 0 v_~x$r_buff0_thd0~0_70) (= |v_#NULL.offset_4| 0) (= v_~x~0_39 0) (= 0 v_~x$w_buff0~0_39) (= 0 |v_ULTIMATE.start_main_~#t599~0.offset_18|) (= 0 v_~__unbuffered_p1_EBX~0_8) (= |v_#valid_42| (store .cse0 |v_ULTIMATE.start_main_~#t599~0.base_24| 1)) (= 0 v_~__unbuffered_p1_EAX~0_8) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_23, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_21|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_12|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_13|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, #length=|v_#length_17|, ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_8|, ~x$w_buff1~0=v_~x$w_buff1~0_36, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_24|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_40, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_14|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_14|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_12|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~x~0=v_~x~0_39, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_~#t599~0.base=|v_ULTIMATE.start_main_~#t599~0.base_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_13|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_15|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_12|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_~#t599~0.offset=|v_ULTIMATE.start_main_~#t599~0.offset_18|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t600~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t600~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t599~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_~#t599~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 20:43:39,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L797-1-->L799: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t600~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t600~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t600~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13|) |v_ULTIMATE.start_main_~#t600~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t600~0.offset_11| 0) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13| 1)) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_13|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t600~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t600~0.base, #length] because there is no mapped edge [2019-12-18 20:43:39,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 1 v_~x$w_buff0_used~0_106) (= v_~x$w_buff1_used~0_59 v_~x$w_buff0_used~0_107) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_25 v_~x$w_buff1~0_20) (= 0 (mod v_~x$w_buff1_used~0_59 256)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 2 v_~x$w_buff0~0_24)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_24, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} 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 20:43:39,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-892674088 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-892674088 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite11_Out-892674088| |P1Thread1of1ForFork1_#t~ite12_Out-892674088|))) (or (and (= ~x$w_buff0~0_In-892674088 |P1Thread1of1ForFork1_#t~ite11_Out-892674088|) (not .cse0) (not .cse1) .cse2) (and (= ~x$w_buff1~0_In-892674088 |P1Thread1of1ForFork1_#t~ite11_Out-892674088|) (or .cse0 .cse1) .cse2))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-892674088, ~x$w_buff1~0=~x$w_buff1~0_In-892674088, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-892674088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-892674088} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-892674088, ~x$w_buff1~0=~x$w_buff1~0_In-892674088, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-892674088|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-892674088|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-892674088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-892674088} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 20:43:39,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_58 v_~x$r_buff0_thd2~0_57) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 20:43:39,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1897605277 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1897605277| ~x~0_In-1897605277) .cse0) (and (not .cse0) (= ~x$mem_tmp~0_In-1897605277 |P1Thread1of1ForFork1_#t~ite31_Out-1897605277|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1897605277, ~x$mem_tmp~0=~x$mem_tmp~0_In-1897605277, ~x~0=~x~0_In-1897605277} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1897605277, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1897605277|, ~x$mem_tmp~0=~x$mem_tmp~0_In-1897605277, ~x~0=~x~0_In-1897605277} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 20:43:39,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1681992462 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1681992462 256) 0)) (.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out-1681992462| |P0Thread1of1ForFork0_#t~ite3_Out-1681992462|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~x$w_buff1~0_In-1681992462 |P0Thread1of1ForFork0_#t~ite3_Out-1681992462|)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1681992462| ~x~0_In-1681992462) (or .cse0 .cse2) .cse1))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1681992462, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1681992462, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1681992462, ~x~0=~x~0_In-1681992462} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1681992462|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1681992462|, ~x$w_buff1~0=~x$w_buff1~0_In-1681992462, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1681992462, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1681992462, ~x~0=~x~0_In-1681992462} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 20:43:39,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1123387528 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1123387528 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1123387528| ~x$w_buff0_used~0_In-1123387528)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1123387528| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1123387528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1123387528} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1123387528|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1123387528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1123387528} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 20:43:39,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1034613826 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1034613826 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1034613826| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1034613826| ~x$w_buff0_used~0_In-1034613826)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1034613826, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1034613826} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1034613826|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1034613826, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1034613826} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:43:39,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In1323146634 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1323146634 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1323146634 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1323146634 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1323146634|)) (and (= ~x$w_buff1_used~0_In1323146634 |P1Thread1of1ForFork1_#t~ite35_Out1323146634|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1323146634, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1323146634, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1323146634, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1323146634} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1323146634, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1323146634, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1323146634|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1323146634, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1323146634} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:43:39,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In18445167 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In18445167 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out18445167 ~x$r_buff0_thd2~0_In18445167) (or .cse0 .cse1)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out18445167 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In18445167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In18445167} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out18445167, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out18445167|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In18445167} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:43:39,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1866087351 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1866087351 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1866087351 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1866087351 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1866087351|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In1866087351 |P1Thread1of1ForFork1_#t~ite37_Out1866087351|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1866087351, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1866087351, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1866087351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1866087351} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1866087351, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1866087351, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1866087351, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1866087351|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1866087351} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:43:39,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_35 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_35, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:43:39,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In470533403 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In470533403 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In470533403 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In470533403 256) 0))) (or (and (= ~x$w_buff1_used~0_In470533403 |P0Thread1of1ForFork0_#t~ite6_Out470533403|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out470533403|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In470533403, ~x$w_buff1_used~0=~x$w_buff1_used~0_In470533403, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In470533403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In470533403} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out470533403|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In470533403, ~x$w_buff1_used~0=~x$w_buff1_used~0_In470533403, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In470533403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In470533403} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 20:43:39,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1490134407 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1490134407 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1490134407| ~x$r_buff0_thd1~0_In1490134407)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out1490134407| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1490134407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1490134407} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1490134407, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1490134407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1490134407} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 20:43:39,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1367641217 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1367641217 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In1367641217 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1367641217 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1367641217| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1367641217| ~x$r_buff1_thd1~0_In1367641217)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1367641217, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1367641217, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1367641217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1367641217} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1367641217, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1367641217|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1367641217, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1367641217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1367641217} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:43:39,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 20:43:39,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_46 256)) (= (mod v_~x$w_buff0_used~0_101 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:43:39,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-2121543062 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2121543062 256)))) (or (and (= ~x~0_In-2121543062 |ULTIMATE.start_main_#t~ite40_Out-2121543062|) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In-2121543062 |ULTIMATE.start_main_#t~ite40_Out-2121543062|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2121543062, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2121543062, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2121543062, ~x~0=~x~0_In-2121543062} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2121543062|, ~x$w_buff1~0=~x$w_buff1~0_In-2121543062, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2121543062, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2121543062, ~x~0=~x~0_In-2121543062} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 20:43:39,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-18 20:43:39,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In788251560 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In788251560 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out788251560| 0)) (and (= ~x$w_buff0_used~0_In788251560 |ULTIMATE.start_main_#t~ite42_Out788251560|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In788251560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In788251560} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In788251560, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out788251560|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In788251560} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:43:39,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In522580437 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In522580437 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In522580437 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In522580437 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out522580437| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In522580437 |ULTIMATE.start_main_#t~ite43_Out522580437|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In522580437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In522580437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In522580437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In522580437} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In522580437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In522580437, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out522580437|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In522580437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In522580437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:43:39,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1661977982 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1661977982 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1661977982| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1661977982| ~x$r_buff0_thd0~0_In-1661977982) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1661977982, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1661977982} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1661977982, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1661977982|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1661977982} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:43:39,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1495791743 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1495791743 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1495791743 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1495791743 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In1495791743 |ULTIMATE.start_main_#t~ite45_Out1495791743|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1495791743|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1495791743, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1495791743, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1495791743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1495791743} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1495791743, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1495791743, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1495791743, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1495791743|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1495791743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:43:39,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1007217661 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite68_Out-1007217661| ~x~0_In-1007217661)) (and (= |ULTIMATE.start_main_#t~ite68_Out-1007217661| ~x$mem_tmp~0_In-1007217661) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1007217661, ~x$mem_tmp~0=~x$mem_tmp~0_In-1007217661, ~x~0=~x~0_In-1007217661} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1007217661, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1007217661|, ~x$mem_tmp~0=~x$mem_tmp~0_In-1007217661, ~x~0=~x~0_In-1007217661} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-18 20:43:39,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_32 |v_ULTIMATE.start_main_#t~ite68_14|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~x$flush_delayed~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_12 256))) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_13|, ~x~0=v_~x~0_32, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:43:39,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:43:39 BasicIcfg [2019-12-18 20:43:39,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:43:39,752 INFO L168 Benchmark]: Toolchain (without parser) took 29317.52 ms. Allocated memory was 138.4 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 101.9 MB in the beginning and 1.0 GB in the end (delta: -917.7 MB). Peak memory consumption was 269.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:39,753 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:43:39,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 877.35 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 157.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:39,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.80 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 154.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:39,760 INFO L168 Benchmark]: Boogie Preprocessor took 41.80 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:39,760 INFO L168 Benchmark]: RCFGBuilder took 854.09 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 95.4 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:39,761 INFO L168 Benchmark]: TraceAbstraction took 27457.87 ms. Allocated memory was 203.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 95.4 MB in the beginning and 1.0 GB in the end (delta: -924.2 MB). Peak memory consumption was 197.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:39,766 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.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 877.35 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 157.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.80 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 154.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.80 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.09 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 95.4 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27457.87 ms. Allocated memory was 203.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 95.4 MB in the beginning and 1.0 GB in the end (delta: -924.2 MB). Peak memory consumption was 197.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 189 ProgramPointsBefore, 114 ProgramPointsAfterwards, 244 TransitionsBefore, 139 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 33 ChoiceCompositions, 10101 VarBasedMoverChecksPositive, 239 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 164896 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t599, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L799] FCALL, FORK 0 pthread_create(&t600, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 x$flush_delayed = weak$$choice2 [L758] 2 x$mem_tmp = x VAL [__unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 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_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] 2 x = !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) [L760] 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_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=2, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 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)) [L761] 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_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=2, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 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)) [L762] 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_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=2, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 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)) [L763] 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_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=2, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 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)) [L765] 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_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=2, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 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)) [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 x = x$flush_delayed ? x$mem_tmp : x [L768] 2 x$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 y = 1 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L774] 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) [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 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 [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 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 [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 x$flush_delayed = weak$$choice2 [L815] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L817] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L818] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L819] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L819] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3069 SDtfs, 2469 SDslu, 5397 SDs, 0 SdLazy, 3084 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 27 SyntacticMatches, 18 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49001occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 24552 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 801 NumberOfCodeBlocks, 801 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 105710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...