/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:09:28,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:09:28,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:09:28,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:09:28,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:09:28,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:09:28,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:09:28,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:09:28,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:09:28,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:09:28,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:09:28,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:09:28,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:09:28,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:09:28,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:09:28,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:09:28,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:09:28,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:09:28,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:09:28,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:09:28,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:09:28,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:09:28,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:09:28,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:09:28,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:09:28,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:09:28,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:09:28,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:09:28,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:09:28,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:09:28,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:09:28,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:09:28,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:09:28,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:09:28,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:09:28,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:09:28,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:09:28,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:09:28,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:09:28,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:09:28,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:09:28,487 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:09:28,523 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:09:28,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:09:28,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:09:28,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:09:28,528 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:09:28,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:09:28,528 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:09:28,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:09:28,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:09:28,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:09:28,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:09:28,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:09:28,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:09:28,532 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:09:28,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:09:28,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:09:28,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:09:28,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:09:28,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:09:28,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:09:28,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:09:28,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:09:28,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:09:28,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:09:28,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:09:28,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:09:28,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:09:28,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:09:28,535 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:09:28,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:09:28,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:09:28,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:09:28,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:09:28,865 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:09:28,865 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:09:28,867 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.opt.i [2019-12-26 21:09:28,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7921cf0c/e8b09dbfa7ae47d08d6a934238444369/FLAG79a66cd33 [2019-12-26 21:09:29,570 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:09:29,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_pso.opt.i [2019-12-26 21:09:29,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7921cf0c/e8b09dbfa7ae47d08d6a934238444369/FLAG79a66cd33 [2019-12-26 21:09:29,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7921cf0c/e8b09dbfa7ae47d08d6a934238444369 [2019-12-26 21:09:29,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:09:29,796 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:09:29,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:09:29,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:09:29,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:09:29,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:09:29" (1/1) ... [2019-12-26 21:09:29,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76530f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:29, skipping insertion in model container [2019-12-26 21:09:29,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:09:29" (1/1) ... [2019-12-26 21:09:29,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:09:29,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:09:30,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:09:30,431 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:09:30,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:09:30,590 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:09:30,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30 WrapperNode [2019-12-26 21:09:30,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:09:30,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:09:30,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:09:30,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:09:30,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (1/1) ... [2019-12-26 21:09:30,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (1/1) ... [2019-12-26 21:09:30,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:09:30,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:09:30,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:09:30,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:09:30,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (1/1) ... [2019-12-26 21:09:30,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (1/1) ... [2019-12-26 21:09:30,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (1/1) ... [2019-12-26 21:09:30,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (1/1) ... [2019-12-26 21:09:30,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (1/1) ... [2019-12-26 21:09:30,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (1/1) ... [2019-12-26 21:09:30,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (1/1) ... [2019-12-26 21:09:30,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:09:30,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:09:30,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:09:30,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:09:30,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (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-26 21:09:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:09:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:09:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:09:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:09:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:09:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:09:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:09:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:09:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:09:30,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:09:30,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:09:30,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:09:30,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:09:30,832 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:09:31,840 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:09:31,841 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:09:31,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:09:31 BoogieIcfgContainer [2019-12-26 21:09:31,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:09:31,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:09:31,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:09:31,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:09:31,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:09:29" (1/3) ... [2019-12-26 21:09:31,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:09:31, skipping insertion in model container [2019-12-26 21:09:31,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:30" (2/3) ... [2019-12-26 21:09:31,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:09:31, skipping insertion in model container [2019-12-26 21:09:31,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:09:31" (3/3) ... [2019-12-26 21:09:31,852 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_pso.opt.i [2019-12-26 21:09:31,863 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:09:31,863 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:09:31,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:09:31,872 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:09:31,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,979 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,988 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,988 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:31,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,027 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,033 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,039 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,050 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,055 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:32,074 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:09:32,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:09:32,092 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:09:32,092 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:09:32,092 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:09:32,092 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:09:32,092 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:09:32,092 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:09:32,092 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:09:32,109 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 244 transitions [2019-12-26 21:09:32,111 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-26 21:09:32,252 INFO L132 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-26 21:09:32,252 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:09:32,271 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 557 event pairs. 0/183 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:09:32,302 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-26 21:09:32,391 INFO L132 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-26 21:09:32,391 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:09:32,402 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 557 event pairs. 0/183 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:09:32,432 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-26 21:09:32,433 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:09:38,357 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-12-26 21:09:38,750 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 21:09:39,390 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 21:09:39,528 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 21:09:39,574 INFO L206 etLargeBlockEncoding]: Checked pairs total: 139722 [2019-12-26 21:09:39,575 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-26 21:09:39,578 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-26 21:09:42,774 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-26 21:09:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-26 21:09:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 21:09:42,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:42,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:09:42,782 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:42,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:42,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1345363696, now seen corresponding path program 1 times [2019-12-26 21:09:42,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:42,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876927136] [2019-12-26 21:09:42,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:43,044 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-26 21:09:43,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876927136] [2019-12-26 21:09:43,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:43,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:09:43,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497930378] [2019-12-26 21:09:43,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:09:43,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:43,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:09:43,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:09:43,072 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-26 21:09:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:43,778 INFO L93 Difference]: Finished difference Result 41750 states and 172028 transitions. [2019-12-26 21:09:43,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:09:43,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 21:09:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:44,073 INFO L225 Difference]: With dead ends: 41750 [2019-12-26 21:09:44,073 INFO L226 Difference]: Without dead ends: 38894 [2019-12-26 21:09:44,075 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-26 21:09:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38894 states. [2019-12-26 21:09:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38894 to 38894. [2019-12-26 21:09:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38894 states. [2019-12-26 21:09:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38894 states to 38894 states and 160140 transitions. [2019-12-26 21:09:47,634 INFO L78 Accepts]: Start accepts. Automaton has 38894 states and 160140 transitions. Word has length 7 [2019-12-26 21:09:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:47,636 INFO L462 AbstractCegarLoop]: Abstraction has 38894 states and 160140 transitions. [2019-12-26 21:09:47,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:09:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 38894 states and 160140 transitions. [2019-12-26 21:09:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:09:47,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:47,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:09:47,641 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:47,642 INFO L82 PathProgramCache]: Analyzing trace with hash 823513967, now seen corresponding path program 1 times [2019-12-26 21:09:47,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:47,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046336422] [2019-12-26 21:09:47,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:47,722 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-26 21:09:47,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046336422] [2019-12-26 21:09:47,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:47,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:09:47,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267159586] [2019-12-26 21:09:47,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:09:47,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:47,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:09:47,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:09:47,727 INFO L87 Difference]: Start difference. First operand 38894 states and 160140 transitions. Second operand 3 states. [2019-12-26 21:09:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:48,154 INFO L93 Difference]: Finished difference Result 21910 states and 79049 transitions. [2019-12-26 21:09:48,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:09:48,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:09:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:48,248 INFO L225 Difference]: With dead ends: 21910 [2019-12-26 21:09:48,248 INFO L226 Difference]: Without dead ends: 21910 [2019-12-26 21:09:48,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:09:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21910 states. [2019-12-26 21:09:50,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21910 to 21910. [2019-12-26 21:09:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21910 states. [2019-12-26 21:09:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21910 states to 21910 states and 79049 transitions. [2019-12-26 21:09:50,702 INFO L78 Accepts]: Start accepts. Automaton has 21910 states and 79049 transitions. Word has length 13 [2019-12-26 21:09:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:50,702 INFO L462 AbstractCegarLoop]: Abstraction has 21910 states and 79049 transitions. [2019-12-26 21:09:50,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:09:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 21910 states and 79049 transitions. [2019-12-26 21:09:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:09:50,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:50,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:09:50,708 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:50,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:50,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1741557527, now seen corresponding path program 1 times [2019-12-26 21:09:50,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:50,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186401605] [2019-12-26 21:09:50,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:50,770 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-26 21:09:50,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186401605] [2019-12-26 21:09:50,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:50,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:09:50,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732721515] [2019-12-26 21:09:50,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:09:50,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:50,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:09:50,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:09:50,772 INFO L87 Difference]: Start difference. First operand 21910 states and 79049 transitions. Second operand 4 states. [2019-12-26 21:09:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:50,828 INFO L93 Difference]: Finished difference Result 4012 states and 11813 transitions. [2019-12-26 21:09:50,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:09:50,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:09:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:50,844 INFO L225 Difference]: With dead ends: 4012 [2019-12-26 21:09:50,844 INFO L226 Difference]: Without dead ends: 4012 [2019-12-26 21:09:50,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:09:50,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2019-12-26 21:09:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 4012. [2019-12-26 21:09:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2019-12-26 21:09:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 11813 transitions. [2019-12-26 21:09:50,933 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 11813 transitions. Word has length 14 [2019-12-26 21:09:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:50,933 INFO L462 AbstractCegarLoop]: Abstraction has 4012 states and 11813 transitions. [2019-12-26 21:09:50,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:09:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 11813 transitions. [2019-12-26 21:09:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:09:50,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:50,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:09:50,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 77685178, now seen corresponding path program 1 times [2019-12-26 21:09:50,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:50,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508083075] [2019-12-26 21:09:50,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:51,021 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-26 21:09:51,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508083075] [2019-12-26 21:09:51,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:51,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:09:51,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973884448] [2019-12-26 21:09:51,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:09:51,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:51,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:09:51,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:09:51,026 INFO L87 Difference]: Start difference. First operand 4012 states and 11813 transitions. Second operand 4 states. [2019-12-26 21:09:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:51,300 INFO L93 Difference]: Finished difference Result 5547 states and 15887 transitions. [2019-12-26 21:09:51,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:09:51,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:09:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:51,323 INFO L225 Difference]: With dead ends: 5547 [2019-12-26 21:09:51,323 INFO L226 Difference]: Without dead ends: 5547 [2019-12-26 21:09:51,323 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-26 21:09:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5547 states. [2019-12-26 21:09:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5547 to 5455. [2019-12-26 21:09:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5455 states. [2019-12-26 21:09:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5455 states to 5455 states and 15718 transitions. [2019-12-26 21:09:51,462 INFO L78 Accepts]: Start accepts. Automaton has 5455 states and 15718 transitions. Word has length 16 [2019-12-26 21:09:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:51,462 INFO L462 AbstractCegarLoop]: Abstraction has 5455 states and 15718 transitions. [2019-12-26 21:09:51,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:09:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5455 states and 15718 transitions. [2019-12-26 21:09:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 21:09:51,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:51,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:09:51,466 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:51,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1886698225, now seen corresponding path program 1 times [2019-12-26 21:09:51,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:51,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48457623] [2019-12-26 21:09:51,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:51,531 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-26 21:09:51,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48457623] [2019-12-26 21:09:51,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:51,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:09:51,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579326039] [2019-12-26 21:09:51,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:09:51,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:09:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:09:51,534 INFO L87 Difference]: Start difference. First operand 5455 states and 15718 transitions. Second operand 3 states. [2019-12-26 21:09:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:51,647 INFO L93 Difference]: Finished difference Result 9509 states and 25812 transitions. [2019-12-26 21:09:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:09:51,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-26 21:09:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:51,669 INFO L225 Difference]: With dead ends: 9509 [2019-12-26 21:09:51,669 INFO L226 Difference]: Without dead ends: 9509 [2019-12-26 21:09:51,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:09:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9509 states. [2019-12-26 21:09:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9509 to 8645. [2019-12-26 21:09:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-12-26 21:09:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 23870 transitions. [2019-12-26 21:09:52,076 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 23870 transitions. Word has length 17 [2019-12-26 21:09:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:52,077 INFO L462 AbstractCegarLoop]: Abstraction has 8645 states and 23870 transitions. [2019-12-26 21:09:52,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:09:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 23870 transitions. [2019-12-26 21:09:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 21:09:52,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:52,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:09:52,080 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:52,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash 365892370, now seen corresponding path program 1 times [2019-12-26 21:09:52,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:52,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434845705] [2019-12-26 21:09:52,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:52,190 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-26 21:09:52,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434845705] [2019-12-26 21:09:52,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:52,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:09:52,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644011773] [2019-12-26 21:09:52,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:09:52,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:52,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:09:52,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:09:52,195 INFO L87 Difference]: Start difference. First operand 8645 states and 23870 transitions. Second operand 4 states. [2019-12-26 21:09:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:52,490 INFO L93 Difference]: Finished difference Result 10846 states and 29430 transitions. [2019-12-26 21:09:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:09:52,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 21:09:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:52,511 INFO L225 Difference]: With dead ends: 10846 [2019-12-26 21:09:52,511 INFO L226 Difference]: Without dead ends: 10846 [2019-12-26 21:09:52,511 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-26 21:09:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10846 states. [2019-12-26 21:09:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10846 to 8676. [2019-12-26 21:09:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8676 states. [2019-12-26 21:09:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8676 states to 8676 states and 23953 transitions. [2019-12-26 21:09:52,720 INFO L78 Accepts]: Start accepts. Automaton has 8676 states and 23953 transitions. Word has length 19 [2019-12-26 21:09:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:52,720 INFO L462 AbstractCegarLoop]: Abstraction has 8676 states and 23953 transitions. [2019-12-26 21:09:52,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:09:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 8676 states and 23953 transitions. [2019-12-26 21:09:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 21:09:52,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:52,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:09:52,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash 49455905, now seen corresponding path program 1 times [2019-12-26 21:09:52,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:52,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322918078] [2019-12-26 21:09:52,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:52,842 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-26 21:09:52,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322918078] [2019-12-26 21:09:52,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:52,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:09:52,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599149922] [2019-12-26 21:09:52,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:09:52,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:52,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:09:52,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:09:52,844 INFO L87 Difference]: Start difference. First operand 8676 states and 23953 transitions. Second operand 5 states. [2019-12-26 21:09:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:52,899 INFO L93 Difference]: Finished difference Result 6781 states and 19450 transitions. [2019-12-26 21:09:52,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:09:52,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 21:09:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:52,912 INFO L225 Difference]: With dead ends: 6781 [2019-12-26 21:09:52,912 INFO L226 Difference]: Without dead ends: 6781 [2019-12-26 21:09:52,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:09:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6781 states. [2019-12-26 21:09:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6781 to 6475. [2019-12-26 21:09:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6475 states. [2019-12-26 21:09:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6475 states to 6475 states and 18723 transitions. [2019-12-26 21:09:53,043 INFO L78 Accepts]: Start accepts. Automaton has 6475 states and 18723 transitions. Word has length 31 [2019-12-26 21:09:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:53,044 INFO L462 AbstractCegarLoop]: Abstraction has 6475 states and 18723 transitions. [2019-12-26 21:09:53,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:09:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6475 states and 18723 transitions. [2019-12-26 21:09:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 21:09:53,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:53,064 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] [2019-12-26 21:09:53,064 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:53,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:53,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1974047026, now seen corresponding path program 1 times [2019-12-26 21:09:53,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:53,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511652337] [2019-12-26 21:09:53,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:53,204 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-26 21:09:53,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511652337] [2019-12-26 21:09:53,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:53,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:09:53,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699578219] [2019-12-26 21:09:53,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:09:53,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:53,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:09:53,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:09:53,206 INFO L87 Difference]: Start difference. First operand 6475 states and 18723 transitions. Second operand 5 states. [2019-12-26 21:09:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:53,369 INFO L93 Difference]: Finished difference Result 11412 states and 33346 transitions. [2019-12-26 21:09:53,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 21:09:53,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-26 21:09:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:53,389 INFO L225 Difference]: With dead ends: 11412 [2019-12-26 21:09:53,390 INFO L226 Difference]: Without dead ends: 10049 [2019-12-26 21:09:53,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:09:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10049 states. [2019-12-26 21:09:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10049 to 8683. [2019-12-26 21:09:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8683 states. [2019-12-26 21:09:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 25455 transitions. [2019-12-26 21:09:53,586 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 25455 transitions. Word has length 61 [2019-12-26 21:09:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:53,587 INFO L462 AbstractCegarLoop]: Abstraction has 8683 states and 25455 transitions. [2019-12-26 21:09:53,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:09:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 25455 transitions. [2019-12-26 21:09:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 21:09:53,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:53,616 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] [2019-12-26 21:09:53,616 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:53,617 INFO L82 PathProgramCache]: Analyzing trace with hash 751894726, now seen corresponding path program 2 times [2019-12-26 21:09:53,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:53,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422579360] [2019-12-26 21:09:53,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:53,731 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-26 21:09:53,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422579360] [2019-12-26 21:09:53,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:53,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:09:53,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912695858] [2019-12-26 21:09:53,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:09:53,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:53,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:09:53,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:09:53,734 INFO L87 Difference]: Start difference. First operand 8683 states and 25455 transitions. Second operand 4 states. [2019-12-26 21:09:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:53,799 INFO L93 Difference]: Finished difference Result 9571 states and 27428 transitions. [2019-12-26 21:09:53,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:09:53,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-26 21:09:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:53,810 INFO L225 Difference]: With dead ends: 9571 [2019-12-26 21:09:53,810 INFO L226 Difference]: Without dead ends: 5225 [2019-12-26 21:09:53,811 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-26 21:09:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-12-26 21:09:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 5225. [2019-12-26 21:09:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5225 states. [2019-12-26 21:09:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5225 states to 5225 states and 13404 transitions. [2019-12-26 21:09:54,068 INFO L78 Accepts]: Start accepts. Automaton has 5225 states and 13404 transitions. Word has length 61 [2019-12-26 21:09:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:54,069 INFO L462 AbstractCegarLoop]: Abstraction has 5225 states and 13404 transitions. [2019-12-26 21:09:54,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:09:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5225 states and 13404 transitions. [2019-12-26 21:09:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 21:09:54,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:54,082 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] [2019-12-26 21:09:54,082 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1404042688, now seen corresponding path program 3 times [2019-12-26 21:09:54,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:54,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806643281] [2019-12-26 21:09:54,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:54,195 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-26 21:09:54,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806643281] [2019-12-26 21:09:54,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:54,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:09:54,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403275034] [2019-12-26 21:09:54,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:09:54,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:09:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:09:54,197 INFO L87 Difference]: Start difference. First operand 5225 states and 13404 transitions. Second operand 4 states. [2019-12-26 21:09:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:54,229 INFO L93 Difference]: Finished difference Result 5687 states and 14450 transitions. [2019-12-26 21:09:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:09:54,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-26 21:09:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:54,231 INFO L225 Difference]: With dead ends: 5687 [2019-12-26 21:09:54,231 INFO L226 Difference]: Without dead ends: 529 [2019-12-26 21:09:54,231 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-26 21:09:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-26 21:09:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-12-26 21:09:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-26 21:09:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1147 transitions. [2019-12-26 21:09:54,239 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1147 transitions. Word has length 61 [2019-12-26 21:09:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:54,239 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1147 transitions. [2019-12-26 21:09:54,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:09:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1147 transitions. [2019-12-26 21:09:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 21:09:54,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:54,241 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] [2019-12-26 21:09:54,242 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash -749342898, now seen corresponding path program 4 times [2019-12-26 21:09:54,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:54,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134576373] [2019-12-26 21:09:54,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:54,334 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-26 21:09:54,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134576373] [2019-12-26 21:09:54,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:54,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:09:54,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014030697] [2019-12-26 21:09:54,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:09:54,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:54,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:09:54,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:09:54,337 INFO L87 Difference]: Start difference. First operand 529 states and 1147 transitions. Second operand 5 states. [2019-12-26 21:09:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:54,396 INFO L93 Difference]: Finished difference Result 1047 states and 2282 transitions. [2019-12-26 21:09:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:09:54,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-26 21:09:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:54,397 INFO L225 Difference]: With dead ends: 1047 [2019-12-26 21:09:54,397 INFO L226 Difference]: Without dead ends: 529 [2019-12-26 21:09:54,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:09:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-26 21:09:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-12-26 21:09:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-26 21:09:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1146 transitions. [2019-12-26 21:09:54,405 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1146 transitions. Word has length 61 [2019-12-26 21:09:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:54,406 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1146 transitions. [2019-12-26 21:09:54,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:09:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1146 transitions. [2019-12-26 21:09:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:09:54,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:54,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:09:54,408 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:54,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash 320699077, now seen corresponding path program 1 times [2019-12-26 21:09:54,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:54,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981466471] [2019-12-26 21:09:54,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:09:54,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981466471] [2019-12-26 21:09:54,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:54,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:09:54,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976404372] [2019-12-26 21:09:54,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:09:54,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:54,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:09:54,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:09:54,549 INFO L87 Difference]: Start difference. First operand 529 states and 1146 transitions. Second operand 8 states. [2019-12-26 21:09:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:54,793 INFO L93 Difference]: Finished difference Result 1082 states and 2317 transitions. [2019-12-26 21:09:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:09:54,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-26 21:09:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:54,795 INFO L225 Difference]: With dead ends: 1082 [2019-12-26 21:09:54,795 INFO L226 Difference]: Without dead ends: 759 [2019-12-26 21:09:54,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:09:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-26 21:09:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 613. [2019-12-26 21:09:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-26 21:09:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1292 transitions. [2019-12-26 21:09:54,805 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1292 transitions. Word has length 62 [2019-12-26 21:09:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:54,805 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1292 transitions. [2019-12-26 21:09:54,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:09:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1292 transitions. [2019-12-26 21:09:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:09:54,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:54,807 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] [2019-12-26 21:09:54,807 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:54,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1761707385, now seen corresponding path program 2 times [2019-12-26 21:09:54,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:54,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246150457] [2019-12-26 21:09:54,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:54,923 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-26 21:09:54,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246150457] [2019-12-26 21:09:54,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:54,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:09:54,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160820377] [2019-12-26 21:09:54,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:09:54,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:54,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:09:54,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:09:54,925 INFO L87 Difference]: Start difference. First operand 613 states and 1292 transitions. Second operand 6 states. [2019-12-26 21:09:55,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:55,373 INFO L93 Difference]: Finished difference Result 1032 states and 2147 transitions. [2019-12-26 21:09:55,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:09:55,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-26 21:09:55,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:55,375 INFO L225 Difference]: With dead ends: 1032 [2019-12-26 21:09:55,375 INFO L226 Difference]: Without dead ends: 1014 [2019-12-26 21:09:55,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:09:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-12-26 21:09:55,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 971. [2019-12-26 21:09:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-12-26 21:09:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 2033 transitions. [2019-12-26 21:09:55,387 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 2033 transitions. Word has length 62 [2019-12-26 21:09:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:55,387 INFO L462 AbstractCegarLoop]: Abstraction has 971 states and 2033 transitions. [2019-12-26 21:09:55,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:09:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 2033 transitions. [2019-12-26 21:09:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:09:55,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:55,390 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] [2019-12-26 21:09:55,390 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:55,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:55,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1412864603, now seen corresponding path program 3 times [2019-12-26 21:09:55,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:55,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139524030] [2019-12-26 21:09:55,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:55,464 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-26 21:09:55,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139524030] [2019-12-26 21:09:55,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:55,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:09:55,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796081756] [2019-12-26 21:09:55,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:09:55,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:55,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:09:55,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:09:55,466 INFO L87 Difference]: Start difference. First operand 971 states and 2033 transitions. Second operand 3 states. [2019-12-26 21:09:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:55,480 INFO L93 Difference]: Finished difference Result 971 states and 2032 transitions. [2019-12-26 21:09:55,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:09:55,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-26 21:09:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:55,481 INFO L225 Difference]: With dead ends: 971 [2019-12-26 21:09:55,482 INFO L226 Difference]: Without dead ends: 971 [2019-12-26 21:09:55,482 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-26 21:09:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-12-26 21:09:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 835. [2019-12-26 21:09:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-12-26 21:09:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1784 transitions. [2019-12-26 21:09:55,495 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1784 transitions. Word has length 62 [2019-12-26 21:09:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:55,496 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1784 transitions. [2019-12-26 21:09:55,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:09:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1784 transitions. [2019-12-26 21:09:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:09:55,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:55,504 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] [2019-12-26 21:09:55,504 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:55,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1992733266, now seen corresponding path program 1 times [2019-12-26 21:09:55,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:55,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328694446] [2019-12-26 21:09:55,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:09:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:09:55,707 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:09:55,708 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:09:55,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t47~0.base_132| 4)) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= v_~z$r_buff1_thd2~0_390 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= |v_#valid_167| (store .cse0 |v_ULTIMATE.start_main_~#t47~0.base_132| 1)) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= 0 |v_ULTIMATE.start_main_~#t47~0.offset_73|) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t47~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t47~0.base_132|) |v_ULTIMATE.start_main_~#t47~0.offset_73| 0)) |v_#memory_int_23|) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t47~0.base_132|) (= v_~__unbuffered_p2_EBX~0_94 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t47~0.base_132|) 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t49~0.base=|v_ULTIMATE.start_main_~#t49~0.base_56|, ULTIMATE.start_main_~#t48~0.offset=|v_ULTIMATE.start_main_~#t48~0.offset_35|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ULTIMATE.start_main_~#t47~0.base=|v_ULTIMATE.start_main_~#t47~0.base_132|, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ULTIMATE.start_main_~#t47~0.offset=|v_ULTIMATE.start_main_~#t47~0.offset_73|, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t49~0.offset=|v_ULTIMATE.start_main_~#t49~0.offset_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t48~0.base=|v_ULTIMATE.start_main_~#t48~0.base_94|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t49~0.base, ULTIMATE.start_main_~#t48~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t47~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t47~0.offset, ~x~0, ULTIMATE.start_main_~#t49~0.offset, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t48~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:09:55,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t48~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t48~0.base_10|) |v_ULTIMATE.start_main_~#t48~0.offset_9| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t48~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t48~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t48~0.base_10|) (= |v_ULTIMATE.start_main_~#t48~0.offset_9| 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t48~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t48~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t48~0.offset=|v_ULTIMATE.start_main_~#t48~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t48~0.base=|v_ULTIMATE.start_main_~#t48~0.base_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t48~0.offset, ULTIMATE.start_main_~#t48~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:09:55,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t49~0.base_11|) (= |v_ULTIMATE.start_main_~#t49~0.offset_9| 0) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t49~0.base_11|)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t49~0.base_11| 1) |v_#valid_35|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t49~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t49~0.base_11|) |v_ULTIMATE.start_main_~#t49~0.offset_9| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t49~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t49~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t49~0.offset=|v_ULTIMATE.start_main_~#t49~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t49~0.base=|v_ULTIMATE.start_main_~#t49~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t49~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t49~0.base] because there is no mapped edge [2019-12-26 21:09:55,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= |v_P2Thread1of1ForFork0_#t~nondet26_14| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_61 1) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38) (= |v_P2Thread1of1ForFork0_#t~nondet27_14| v_~weak$$choice2~0_39)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_14|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_14|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_13|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-26 21:09:55,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In23867455 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In23867455 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out23867455| |P2Thread1of1ForFork0_#t~ite28_Out23867455|))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out23867455| ~z$w_buff0~0_In23867455) .cse0 (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~z$w_buff1~0_In23867455 |P2Thread1of1ForFork0_#t~ite28_Out23867455|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In23867455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In23867455, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In23867455, ~z$w_buff1~0=~z$w_buff1~0_In23867455} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out23867455|, ~z$w_buff0~0=~z$w_buff0~0_In23867455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In23867455, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In23867455, ~z$w_buff1~0=~z$w_buff1~0_In23867455, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out23867455|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:09:55,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:09:55,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1619046308 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out1619046308| ~z$mem_tmp~0_In1619046308)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out1619046308| ~z~0_In1619046308)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1619046308, ~z$flush_delayed~0=~z$flush_delayed~0_In1619046308, ~z~0=~z~0_In1619046308} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1619046308|, ~z$mem_tmp~0=~z$mem_tmp~0_In1619046308, ~z$flush_delayed~0=~z$flush_delayed~0_In1619046308, ~z~0=~z~0_In1619046308} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-26 21:09:55,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.base_9 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_9|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:09:55,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1324004341 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1324004341 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-1324004341|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1324004341 |P2Thread1of1ForFork0_#t~ite51_Out-1324004341|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1324004341, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1324004341} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1324004341, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1324004341, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1324004341|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-26 21:09:55,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-548817239 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-548817239| ~z~0_In-548817239)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-548817239| ~z$mem_tmp~0_In-548817239)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-548817239, ~z$flush_delayed~0=~z$flush_delayed~0_In-548817239, ~z~0=~z~0_In-548817239} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-548817239, ~z$flush_delayed~0=~z$flush_delayed~0_In-548817239, ~z~0=~z~0_In-548817239, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-548817239|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:09:55,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_227) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_88|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_88|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_87|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:09:55,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-961623611 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-961623611 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-961623611 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-961623611 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out-961623611| ~z$w_buff1_used~0_In-961623611) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-961623611|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-961623611, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-961623611, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-961623611, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-961623611} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-961623611, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-961623611, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-961623611, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-961623611|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-961623611} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-26 21:09:55,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2055507021 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2055507021 256)))) (or (and (= ~z$r_buff0_thd3~0_Out-2055507021 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-2055507021 ~z$r_buff0_thd3~0_Out-2055507021) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2055507021, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2055507021} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2055507021, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-2055507021, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-2055507021|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-26 21:09:55,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In27991016 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In27991016 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In27991016 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In27991016 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In27991016 |P2Thread1of1ForFork0_#t~ite54_Out27991016|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite54_Out27991016| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In27991016, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In27991016, ~z$w_buff1_used~0=~z$w_buff1_used~0_In27991016, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In27991016} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In27991016, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out27991016|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In27991016, ~z$w_buff1_used~0=~z$w_buff1_used~0_In27991016, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In27991016} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-26 21:09:55,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_30|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:09:55,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (= 3 v_~__unbuffered_cnt~0_35) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:09:55,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite58_Out1379338309| |ULTIMATE.start_main_#t~ite59_Out1379338309|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1379338309 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1379338309 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite58_Out1379338309| ~z~0_In1379338309) (or .cse1 .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite58_Out1379338309| ~z$w_buff1~0_In1379338309) (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1379338309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1379338309, ~z$w_buff1~0=~z$w_buff1~0_In1379338309, ~z~0=~z~0_In1379338309} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1379338309, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1379338309|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1379338309, ~z$w_buff1~0=~z$w_buff1~0_In1379338309, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1379338309|, ~z~0=~z~0_In1379338309} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 21:09:55,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1786260446 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1786260446 256)))) (or (and (= ~z$w_buff0_used~0_In1786260446 |ULTIMATE.start_main_#t~ite60_Out1786260446|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out1786260446| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1786260446, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1786260446} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1786260446|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1786260446, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1786260446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-26 21:09:55,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In313015600 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In313015600 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In313015600 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In313015600 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In313015600 |ULTIMATE.start_main_#t~ite61_Out313015600|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite61_Out313015600|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In313015600, ~z$w_buff0_used~0=~z$w_buff0_used~0_In313015600, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In313015600, ~z$w_buff1_used~0=~z$w_buff1_used~0_In313015600} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In313015600, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out313015600|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In313015600, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In313015600, ~z$w_buff1_used~0=~z$w_buff1_used~0_In313015600} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-26 21:09:55,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In454247062 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In454247062 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out454247062| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out454247062| ~z$r_buff0_thd0~0_In454247062) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In454247062, ~z$w_buff0_used~0=~z$w_buff0_used~0_In454247062} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out454247062|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In454247062, ~z$w_buff0_used~0=~z$w_buff0_used~0_In454247062} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-26 21:09:55,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-2134402305 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-2134402305 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2134402305 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2134402305 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-2134402305| ~z$r_buff1_thd0~0_In-2134402305) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite63_Out-2134402305| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2134402305, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134402305, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2134402305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2134402305} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2134402305|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2134402305, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134402305, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2134402305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2134402305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-26 21:09:55,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_28 0) (= v_~main$tmp_guard1~0_24 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= 1 v_~__unbuffered_p1_EAX~0_51) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:09:55,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:09:55 BasicIcfg [2019-12-26 21:09:55,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:09:55,974 INFO L168 Benchmark]: Toolchain (without parser) took 26178.52 ms. Allocated memory was 136.3 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 99.2 MB in the beginning and 523.8 MB in the end (delta: -424.6 MB). Peak memory consumption was 729.4 MB. Max. memory is 7.1 GB. [2019-12-26 21:09:55,976 INFO L168 Benchmark]: CDTParser took 1.50 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 21:09:55,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.43 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 98.8 MB in the beginning and 154.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-26 21:09:55,977 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.25 ms. Allocated memory is still 201.3 MB. Free memory was 154.2 MB in the beginning and 151.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:09:55,978 INFO L168 Benchmark]: Boogie Preprocessor took 59.45 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 148.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:09:55,982 INFO L168 Benchmark]: RCFGBuilder took 1111.35 ms. Allocated memory is still 201.3 MB. Free memory was 148.2 MB in the beginning and 92.2 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:09:55,982 INFO L168 Benchmark]: TraceAbstraction took 24128.66 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 92.2 MB in the beginning and 523.8 MB in the end (delta: -431.6 MB). Peak memory consumption was 657.4 MB. Max. memory is 7.1 GB. [2019-12-26 21:09:55,985 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.50 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.43 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 98.8 MB in the beginning and 154.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.25 ms. Allocated memory is still 201.3 MB. Free memory was 154.2 MB in the beginning and 151.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.45 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 148.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1111.35 ms. Allocated memory is still 201.3 MB. Free memory was 148.2 MB in the beginning and 92.2 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24128.66 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 92.2 MB in the beginning and 523.8 MB in the end (delta: -431.6 MB). Peak memory consumption was 657.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.4s, 198 ProgramPointsBefore, 105 ProgramPointsAfterwards, 244 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 58 ConcurrentYvCompositions, 28 ChoiceCompositions, 9655 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 339 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 0 MoverChecksTotal, 139722 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t47, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t48, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t49, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1 = z$w_buff0 [L792] 3 z$w_buff0 = 1 [L793] 3 z$w_buff1_used = z$w_buff0_used [L794] 3 z$w_buff0_used = (_Bool)1 [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L808] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L809] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L810] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$flush_delayed ? z$mem_tmp : z [L816] 3 z$flush_delayed = (_Bool)0 [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 y = 1 [L763] 2 __unbuffered_p1_EAX = y [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 z$flush_delayed = weak$$choice2 [L769] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L771] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L772] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L773] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L776] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 189 locations, 2 error locations. Result: UNSAFE, OverallTime: 23.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2459 SDtfs, 2189 SDslu, 4174 SDs, 0 SdLazy, 1142 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42030occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 5123 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 79581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...